When does the mean network capture the topology of a sample of networks?
Not on the map. Why?
Abstract (arXiv)
The notion of Fr'echet mean (also known as "barycenter") network is the workhorse of most machine learning algorithms that require the estimation of a "location" parameter to analyse network-valued data. In this context, it is critical that the network barycenter inherits the topological structure of the networks in the training dataset. The metric - which measures the proximity between networks - controls the structural properties of the barycenter. This work is significant because it provides for the first time analytical estimates of the sample Fr'echet mean for the stochastic blockmodel, which is at the cutting edge of rigorous probabilistic analysis of random networks. We show that the mean network computed with the Hamming distance is unable to capture the topology of the networks in the training sample, whereas the mean network computed using the effective resistance distance recovers the correct partitions and associated edge density. From a practical standpoint, our work informs the choice of metrics in the context where the sample Fr'echet mean network is used to characterise the topology of networks for network-valued machine learning
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 13 of its 44 references that are in the map. First posted on arXiv 6 Aug 2024.
Builds on
13 of 44 references.
References · 13
- 2017Community Detection and Stochastic Block Modelscited by 317
- 2014Graph-based Anomaly Detection and Description: A Surveycited by 182
- 2016Fr'echet Regression for Random Objects with Euclidean Predictorscited by 57
- 2013Stochastic blockmodel approximation of a graphon: Theory and consistent estimationcited by 38
- 2019Metrics for Graph Comparison: A Practitioner's Guidecited by 37
- 2019Gromov-Wasserstein Factorization Models for Graph Clusteringcited by 25
- 2013Network histograms and universality of blockmodel approximationcited by 20
- 2014Hypothesis Testing For Network Data in Functional Neuroimagingcited by 20
- 2020Strong Consistency, Graph Laplacians, and the Stochastic Block Modelcited by 20
- 2017Two-sample Hypothesis Testing for Inhomogeneous Random Graphscited by 13
- 2019Modeling Network Populations via Graph Distancescited by 13
- 2016The Resistance Perturbation Distance: A Metric for the Analysis of Dynamic Networkscited by 5
1 more
- 2018Change Point Methods on a Sequence of Graphscited by 4
Built on by
Citing papers per year: 2025: 1.
1 paper.