The Importance of Being Correlated: Implications of Dependence in Joint Spectral Inference across Multiple Networks
Not on the map. Why?
Abstract (arXiv)
Spectral inference on multiple networks is a rapidly-developing subfield of graph statistics. Recent work has demonstrated that joint, or simultaneous, spectral embedding of multiple independent networks can deliver more accurate estimation than individual spectral decompositions of those same networks. Such inference procedures typically rely heavily on independence assumptions across the multiple network realizations, and even in this case, little attention has been paid to the induced network correlation in such joint embeddings. Here, we present a generalized omnibus embedding methodology and provide a detailed analysis of this embedding across both independent and correlated networks, the latter of which significantly extends the reach of such procedures. We describe how this omnibus embedding can itself induce correlation, leading us to distinguish between inherent correlation -- the correlation that arises naturally in multisample network data -- and induced correlation, which is an artifice of the joint embedding methodology. We show that the generalized omnibus embedding procedure is flexible and robust, and prove both consistency and a central limit theorem for the embedded points. We examine how induced and inherent correlation can impact inference for network time series data, and we provide network analogues of classical questions such as the effective sample size for more generally correlated data. Further, we show how an appropriately calibrated generalized omnibus embedding can detect changes in real biological networks that previous embedding procedures could not discern, confirming that the effect of inherent and induced correlation can be subtle and transformative, with import in theory and practice.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Aug 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 1; 2025: 1.
5 papers.
- 2022Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labelscited by 3
- 2022Concentration inequalities for correlated network-valued processes with applications to community estimation and changepoint analysiscited by 1
- 2023Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embeddingcited by 1
- 2024Optimizing the Induced Correlation in Omnibus Joint Graph Embeddingscited by 0
- 2025Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)cited by 0
- 2025Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)3 Jun 2025
- 2024Optimizing the Induced Correlation in Omnibus Joint Graph Embeddings26 Sep 2024
- 2023Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding18 Dec 2023
- 2022Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labels18 Aug 2022
- 2022Concentration inequalities for correlated network-valued processes with applications to community estimation and changepoint analysis2 Aug 2022