Recovering shared structure from multiple networks with unknown edge distributions
Not on the map. Why?
Abstract (arXiv)
In increasingly many settings, data sets consist of multiple samples from a population of networks, with vertices aligned across these networks. For example, brain connectivity networks in neuroscience consist of measures of interaction between brain regions that have been aligned to a common template. We consider the setting where the observed networks have a shared expectation, but may differ in the noise structure on their edges. Our approach exploits the shared mean structure to denoise edge-level measurements of the observed networks and estimate the underlying population-level parameters. We also explore the extent to which edge-level errors influence estimation and downstream inference. We establish a finite-sample concentration inequality for the low-rank eigenvalue truncation of a random weighted adjacency matrix that may be of independent interest. The proposed approach is illustrated on synthetic networks and on data from an fMRI study of schizophrenia.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Jun 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 2; 2025: 1; 2026: 2.
8 papers.
- 2022Consensus Knowledge Graph Learning via Multi-view Sparse Low Rank Block Modelcited by 3
- 2024Transfer Learning for Latent Variable Network Modelscited by 3
- 2023A pseudo-likelihood approach to community detection in weighted networkscited by 2
- 2025Optimal Transfer Learning for Missing Not-at-Random Matrix Completioncited by 2
- 2022SIMPLE-RC: Group Network Inference with Non-Sharp Nulls and Weak Signalscited by 1
- 2024Signed Diverse Multiplex Networks: Clustering and Inferencecited by 1
- 2026Matching and mixing: Matchability of graphs under Markovian errorcited by 0
- 2026Adjacency Spectral Embeddings of Correlation Networkscited by 0
- 2026Adjacency Spectral Embeddings of Correlation Networks24 Feb 2026
- 2026Matching and mixing: Matchability of graphs under Markovian error27 Jan 2026
- 2025Optimal Transfer Learning for Missing Not-at-Random Matrix Completion28 Feb 2025
- 2024Transfer Learning for Latent Variable Network Models5 Jun 2024
- 2024Signed Diverse Multiplex Networks: Clustering and Inference14 Feb 2024
- 2023A pseudo-likelihood approach to community detection in weighted networks10 Mar 2023
- 2022SIMPLE-RC: Group Network Inference with Non-Sharp Nulls and Weak Signals31 Oct 2022
- 2022Consensus Knowledge Graph Learning via Multi-view Sparse Low Rank Block Model28 Sep 2022