Barycentric subspace analysis of network-valued data
Abstract
Certain data are naturally modeled by networks or weighted graphs, be they biological networks or mobility networks. When there is no canonical labeling of the nodes across the dataset, we talk about unlabeled networks. In this paper, we focus on the question of exploratory analysis of this type of data. More specifically, we address the issue of interpreting the feature subspace constructed by dimensionality reduction methods. Most existing methods for network-valued data are derived from principal component analysis (PCA) and therefore rely on subspaces generated by a set of vectors, which we identify as a major limitation in terms of interpretability. Instead, we propose to implement the method called barycentric subspace analysis (BSA), which relies on subspaces generated by a set of points, which we choose, in practice, to be samples. In order to provide a computationally feasible framework for BSA, we introduce a novel embedding for unlabeled networks where we replace their usual representation by equivalence classes of isomorphic networks with that by equivalence classes of cospectral networks. In a simulated study, we demonstrate the improved interpretability of BSA compared to tangent PCA. We then illustrate through two real-world datasets how BSA can be used both to visualize known patterns and to discover new ones in network-valued distributions.
Related
- Covariance Kernels on Unordered Pair Spaces: Theory and Applications to Network-Valued Data
- Rational barycentric coordinates and low degree adjoints
- On the minimizer of the barycentric isoperimetric ratio among connected planar sets
- Lipschitz clustering in normed spaces and barycentric spaces
- Centroids for weak optimal transport with barycentric cost
BibTeX
@misc{maignant2026barycentric,
title = {{Barycentric subspace analysis of network-valued data}},
author = {Elodie Maignant and Xavier Pennec and Alain Trouvé and Anna Calissano},
howpublished = {HAL},
year = {2026},
month = sep,
url = {https://hal.science/hal-05191923v2},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Barycentric subspace analysis of network-valued data
AU - Elodie Maignant
AU - Xavier Pennec
AU - Alain Trouvé
AU - Anna Calissano
PY - 2026
DA - 2026/09/25
PB - HAL
UR - https://hal.science/hal-05191923v2
AB - Certain data are naturally modeled by networks or weighted graphs, be they biological networks or mobility networks. When there is no canonical labeling of the nodes across the dataset, we talk about unlabeled networks. In this paper, we focus on the question of exploratory analysis of this type of data. More specifically, we address the issue of interpreting the feature subspace constructed by dimensionality reduction methods. Most existing methods for network-valued data are derived from principal component analysis (PCA) and therefore rely on subspaces generated by a set of vectors, which we identify as a major limitation in terms of interpretability. Instead, we propose to implement the method called barycentric subspace analysis (BSA), which relies on subspaces generated by a set of points, which we choose, in practice, to be samples. In order to provide a computationally feasible framework for BSA, we introduce a novel embedding for unlabeled networks where we replace their usual representation by equivalence classes of isomorphic networks with that by equivalence classes of cospectral networks. In a simulated study, we demonstrate the improved interpretability of BSA compared to tangent PCA. We then illustrate through two real-world datasets how BSA can be used both to visualize known patterns and to discover new ones in network-valued distributions.
ER -