The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Graph Spectra and the Detectability of Community Structure in Networks
Open accessAbstract
We study networks that display community structure--groups of nodes within which connections are unusually dense. Using methods from random matrix theory, we calculate the spectra of such networks in the limit of large size, and hence demonstrate the presence of a phase transition in matrix methods for community detection, such as the popular modularity maximization method. The transition separates a regime in which such methods successfully detect the community structure from one in which the structure is present but is not detected. By comparing these results with recent analyses of maximum-likelihood methods, we are able to show that spectral modularity maximization is an optimal detection method in the sense that no other method will succeed in the regime where the modularity method fails.
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
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Self-citationModularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Self-citationFortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Benchmark graphs for testing community detection algorithms
Lancichinetti, A., Fortunato, S., & Radicchi, F. (2008) · Physical Review E · doi:10.1103/physreve.78.046110 · Cited by 3,051
Stochastic blockmodels and community structure in networks
Karrer, B., & Newman, M. E. J. (2011) · Physical Review E · doi:10.1103/physreve.83.016107 · Cited by 2,025
Self-citationThe eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
Benaych-Georges, F., & Nadakuditi, R. R. (2011) · Advances in Mathematics · doi:10.1016/j.aim.2011.02.007 · Cited by 441
Self-citationAlgorithms for graph partitioning on the planted partition model
Condon, A., & Karp, R. M. (2001) · Random Structures and Algorithms · doi:10.1002/1098-2418(200103)18:2<116::aid-rsa1001>3.0.co;2-2 · Cited by 429
Inference and Phase Transitions in the Detection of Modules in Sparse Networks
Decelle, A., Krzakala, F., Moore, C., & Zdeborová, L. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.065701 · Cited by 392
Spherical Model of a Spin-Glass
Kosterlitz, J. M., Thouless, D. J., & Jones, R. C. (1976) · Physical Review Letters · doi:10.1103/physrevlett.36.1217 · Cited by 375
(Un)detectable Cluster Structure in Sparse Networks
Reichardt, J., & Leone, M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.078701 · Cited by 74
Cited by
Community detection in networks: a user guide
Fortunato, S., & Hric, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.09.002 · Cited by 2,086
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
Community Detection and Stochastic Block Models
Abbe, E. (2018) · now publishers, Inc. eBooks · doi:10.1561/9781680834772 · Cited by 544
Spectral methods for community detection and graph partitioning
Newman, M. E. J. (2013) · Physical Review E · doi:10.1103/physreve.88.042822 · Cited by 424
Self-citationCommunity detection thresholds and the weak Ramanujan property
Massoulié, L. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591857 · Cited by 316
Metadata
- Authors
- Nadakuditi, R. R., & Newman, M. E. J.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2012-05-01
- Volume
- 108
- Issue
- 18
- Pages
- 188701-188701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2014259951
- Cited by
- 316
- References
- 10
- FWCI
- 27.25
- Type
- journal article
- 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: Graph Spectra and the Detectability of Community Structure in Networks. https://app.cochat.ai/papers/10.1103/physrevlett.108.188701
- The paper
- Nadakuditi, R. R., & Newman, M. E. J. (2012). Graph Spectra and the Detectability of Community Structure in Networks. Physical Review Letters. https://doi.org/10.1103/physrevlett.108.188701
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.