Exact Community Recovery in Correlated Stochastic Block Models
Not on the map. Why?
Abstract (arXiv)
We consider the problem of learning latent community structure from multiple correlated networks. We study edge-correlated stochastic block models with two balanced communities, focusing on the regime where the average degree is logarithmic in the number of vertices. Our main result derives the precise information-theoretic threshold for exact community recovery using multiple correlated graphs. This threshold captures the interplay between the community recovery and graph matching tasks. In particular, we uncover and characterize a region of the parameter space where exact community recovery is possible using multiple correlated graphs, even though (1) this is information-theoretically impossible using a single graph and (2) exact graph matching is also information-theoretically impossible. In this regime, we develop a novel algorithm that carefully synthesizes algorithms from the community recovery and graph matching literatures.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 39 of its 63 references that are in the map. First posted on arXiv 29 Mar 2022.
Builds on
39 of 63 references.
References · 39
- 2017Community Detection and Stochastic Block Modelscited by 317
- 2018Contextual Stochastic Block Modelscited by 134
- 2014Exact Recovery in the Stochastic Block Modelcited by 77
- 2018Efficient random graph matching via degree profilescited by 48
- 2013Community detection thresholds and the weak Ramanujan propertycited by 47
- 2021Settling the Sharp Reconstruction Thresholds of Random Graph Matchingcited by 45
- 2019Inference for multiple heterogeneous networks with a common invariant subspacecited by 39
- 2013A Proof Of The Block Model Threshold Conjecturecited by 35
- 2017Exact alignment recovery for correlated ErdHos-R'enyi graphscited by 35
- 2016Improved Achievability and Converse Bounds for ErdHos-R'enyi Graph Matchingcited by 30
- 2014Covariate-assisted spectral clusteringcited by 29
- 2018(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphscited by 29
27 more
- 2017Spectral and matrix factorization methods for consistent community detection in multi-layer networkscited by 27
- 2018Seeded Graph Matching via Large Neighborhood Statisticscited by 27
- 2020Partial Recovery in the Graph Alignment Problemcited by 27
- 2015Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphscited by 26
- 2020From tree matching to sparse graph alignmentcited by 26
- 2018Partial Recovery of ErdHos-R'enyi Graph Alignment via k-Core Alignmentcited by 25
- 2014Consistency Thresholds for the Planted Bisection Modelcited by 24
- 2021Exact Matching of Random Graphs with Constant Correlationcited by 23
- 2020Contextual Stochastic Block Model: Sharp Thresholds and Contiguitycited by 22
- 2021Correlated Stochastic Block Models: Exact Graph Matching with Applications to Recovering Communitiescited by 22
- 2021Impossibility of Partial Recovery in the Graph Alignment Problemcited by 21
- 2015Clustering attributed graphs: models, measures and methodscited by 20
- 2021Random Graph Matching with Improved Noise Robustnesscited by 16
- 2013An efficient reconciliation algorithm for social networkscited by 12
- 2016Covariate Regularized Community Detection in Sparse Graphscited by 12
- 2020Correlated randomly growing graphscited by 12
- 2016Optimal De-Anonymization in Random Graphs with Community Structurecited by 11
- 2020Global and Individualized Community Detection in Inhomogeneous Multilayer Networkscited by 11
- 2015Community Detection in Networks with Node Featurescited by 10
- 2016Information Recovery in Shuffled Graphs via Graph Matchingcited by 8
- 2015Local Algorithms for Block Models with Side Informationcited by 7
- 2019Mutual Information in Community Detection with Covariate Information and Correlated Networkscited by 7
- 2021The Power of D-hops in Matching Power-Law Graphscited by 7
- 2014Global and Local Information in Clustering Labeled Block Modelscited by 5
- 2018Latent heterogeneous multilayer community detectioncited by 5
- 2018Recovering a Single Community with Side Informationcited by 5
- 2016On the Simultaneous Preservation of Privacy and Community Structure in Anonymized Networkscited by 4
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 3; 2025: 2; 2026: 1.
8 papers.
- 2022Effects of Graph Convolutions in Multi-layer Networkscited by 24
- 2023Matching Correlated Inhomogeneous Random Graphs using the k-core Estimatorcited by 6
- 2024Harnessing Multiple Correlated Networks for Exact Community Recoverycited by 3
- 2025Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguitycited by 2
- 2024Community Detection in the Multi-View Stochastic Block Modelcited by 1
- 2025Exact Matching in Correlated Networks with Node Attributes for Improved Community Recoverycited by 1
- 2024Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphscited by 0
- 2026Query-Limited Community Recovery in Stochastic Block Modelscited by 0
- 2026Query-Limited Community Recovery in Stochastic Block Models1 Jun 2026
- 2025Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity14 Feb 2025
- 2025Exact Matching in Correlated Networks with Node Attributes for Improved Community Recovery6 Jan 2025
- 2024Harnessing Multiple Correlated Networks for Exact Community Recovery3 Dec 2024
- 2024Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs8 Jun 2024
- 2024Community Detection in the Multi-View Stochastic Block Model17 Jan 2024
- 2023Matching Correlated Inhomogeneous Random Graphs using the k-core Estimator10 Feb 2023
- 2022Effects of Graph Convolutions in Multi-layer Networks20 Apr 2022