The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Community detection thresholds and the weak Ramanujan property
Open accessAbstract
Decelle et al. [1] conjectured the existence of a sharp threshold on model parameters for community detection in sparse random graphs drawn from the stochastic block model. Mossel, Neeman and Sly [2] established the negative part of the conjecture, proving impossibility of non-trivial reconstruction below the threshold. In this work we solve the positive part of the conjecture. To that end we introduce a modified adjacency matrix B which counts self-avoiding paths of a given length ℓ between pairs of nodes. We then prove that for logarithmic length ℓ, the leading eigenvectors of this modified matrix provide a non-trivial reconstruction of the underlying structure, thereby settling the conjecture. A key step in the proof consists in establishing a weak Ramanujan property of the constructed matrix B. Namely, the spectrum of B consists in two leading eigenvalues ρ(B), λ2 and n -- 2 eigenvalues of a lower order O(nε √ρ(B) for all ε 0, ρ(B) denoting B's spectral radius.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Stochastic blockmodels: First steps
Holland, P. W., Laskey, K. B., & Leinhardt, S. (1983) · Social Networks · doi:10.1016/0378-8733(83)90021-7 · Cited by 2,755
Williams, D. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511813658 · Cited by 1,691
(1992) · Choice Reviews Online · doi:10.5860/choice.30-1565 · Cited by 1,415
Decelle, A., Krzakala, F., Moore, C., & Zdeborová, L. (2011) · Physical Review E · doi:10.1103/physreve.84.066106 · Cited by 747
Spectral redemption in clustering sparse networks
Krzakala, F., Moore, C., Mossel, E., Neeman, J., Sly, A., Zdeborová, L., & Zhang, P. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1312486110 · Cited by 638
The eigenvalues of random symmetric matrices
Füredi, Z., & Komlós, J. (1981) · Combinatorica · doi:10.1007/bf02579329 · Cited by 633
A proof of Alon’s second eigenvalue conjecture and related problems
Friedman, J. (2008) · Memoirs of the American Mathematical Society · doi:10.1090/memo/0910 · Cited by 328
Graph Spectra and the Detectability of Community Structure in Networks
Nadakuditi, R. R., & Newman, M. E. J. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.188701 · Cited by 316
Reconstruction and estimation in the planted partition model
Mossel, E., Neeman, J., & Sly, A. (2015) · Probability Theory and Related Fields · doi:10.1007/s00440-014-0576-6 · Cited by 301
Broadcasting on trees and the Ising model
Evans, W., Kenyon, C., Peres, Y., & Schulman, L. J. (2000) · The Annals of Applied Probability · doi:10.1214/aoap/1019487349 · Cited by 270
Cited by
Community Detection and Stochastic Block Models
Abbe, E. (2018) · now publishers, Inc. eBooks · doi:10.1561/9781680834772 · Cited by 544
The ground truth about metadata and community detection in networks
Peel, L., Larremore, D. B., & Clauset, A. (2017) · Science Advances · doi:10.1126/sciadv.1602548 · Cited by 449
Statistical physics of inference: thresholds and algorithms
Zdeborová, L., & Krzakala, F. (2016) · Advances in Physics · doi:10.1080/00018732.2016.1211393 · Cited by 440
Consistency of spectral clustering in stochastic block models
Lei, J., & Rinaldo, A. (2015) · The Annals of Statistics · doi:10.1214/14-aos1274 · Cited by 330
Abbe, E., & Sandon, C. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.47 · Cited by 254
Metadata
- Authors
- Massoulié, L.
- Venue
- Proceedings of the forty-sixth annual ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2014-05-31
- Pages
- 694-703
- OpenAlex
- W2023348178
- Cited by
- 316
- References
- 13
- FWCI
- 39.42
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Community detection thresholds and the weak Ramanujan property. https://app.cochat.ai/papers/10.1145/2591796.2591857
- The paper
- Massoulié, L. (2014). Community detection thresholds and the weak Ramanujan property. Proceedings of the forty-sixth annual ACM symposium on Theory of computing. https://doi.org/10.1145/2591796.2591857
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.