Lost in the Shuffle: Testing Power in the Presence of Errorful Network Vertex Labels
Not on the map. Why?
Abstract (arXiv)
Two-sample network hypothesis testing is an important inference task with applications across diverse fields such as medicine, neuroscience, and sociology. Many of these testing methodologies operate under the implicit assumption that the vertex correspondence across networks is a priori known. This assumption is often untrue, and the power of the subsequent test can degrade when there are misaligned/label-shuffled vertices across networks. This power loss due to shuffling is theoretically explored in the context of random dot product and stochastic block model networks for a pair of hypothesis tests based on Frobenius norm differences between estimated edge probability matrices or between adjacency matrices. The loss in testing power is further reinforced by numerous simulations and experiments, both in the stochastic block model and in the random dot product graph model, where the power loss across multiple recently proposed tests in the literature is considered. Lastly, the impact that shuffling can have in real-data testing is demonstrated in a pair of examples from neuroscience and from social network analysis.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 30 of its 85 references that are in the map. First posted on arXiv 18 Aug 2022.
Builds on
30 of 85 references.
References · 30
- 2013Consistency of spectral clustering in stochastic block modelscited by 129
- 2017Statistical inference on random dot product graphs: a surveycited by 70
- 2015Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveyscited by 60
- 2017A statistical interpretation of spectral embedding: the generalised random dot product graphcited by 55
- 2018REGAL: Representation Learning-based Graph Alignmentcited by 40
- 2019Inference for multiple heterogeneous networks with a common invariant subspacecited by 39
- 2018Seeded Graph Matching via Large Neighborhood Statisticscited by 27
- 2016Network cross-validation by edge samplingcited by 26
- 2013Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embeddingcited by 23
- 2015Community Detection and Classification in Hierarchical Stochastic Blockmodelscited by 23
- 2014Hypothesis Testing For Network Data in Functional Neuroimagingcited by 20
- 2014A goodness-of-fit test for stochastic block modelscited by 20
18 more
- 2018Hierarchical community detection by recursive partitioningcited by 16
- 2019Bootstrapping Networks with Latent Space Structurecited by 12
- 2014Nonparametric Bayes Modeling of Populations of Networkscited by 11
- 2019Spectral embedding of weighted graphscited by 9
- 2020Spectral clustering on spherical coordinates under the degree-corrected stochastic blockmodelcited by 9
- 2013Vertex nomination schemes for membership predictioncited by 8
- 2016Information Recovery in Shuffled Graphs via Graph Matchingcited by 8
- 2013Robust Multimodal Graph Matching: Sparse Coding Meets Graph Matchingcited by 7
- 2014Bayesian Inference and Testing of Group Differences in Brain Networkscited by 6
- 2018Vertex nomination: The canonical sampling and the extended spectral nomination schemescited by 6
- 2020Multiple Network Embedding for Anomaly Detection in Time Series of Graphscited by 6
- 2017Vertex Nomination Via Seeded Graph Matchingcited by 5
- 2020The Importance of Being Correlated: Implications of Dependence in Joint Spectral Inference across Multiple Networkscited by 5
- 2021Hypothesis Testing for Equality of Latent Positions in Random Graphscited by 5
- 2019Hypothesis testing for populations of networkscited by 4
- 2021The Phantom Alignment Strength Conjecture: Practical use of graph matching alignment strength to indicate a meaningful graph matchcited by 4
- 2013A central limit theorem for scaled eigenvectors of random dot product graphscited by 2
- 2013Computing Scalable Multivariate Glocal Invariants of Large (Brain-) Graphscited by 1
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1; 2026: 1.
3 papers.
- 2023Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embeddingcited by 1
- 2025Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)cited by 0
- 2026Matching and mixing: Matchability of graphs under Markovian errorcited by 0
- 2026Matching and mixing: Matchability of graphs under Markovian error27 Jan 2026
- 2025Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)3 Jun 2025
- 2023Detection of Model-based Planted Pseudo-cliques in Random Dot Product Graphs by the Adjacency Spectral Embedding and the Graph Encoder Embedding18 Dec 2023