The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery
Abstract
New phase transition phenomena have recently been discovered for the stochastic block model, for the special case of two non-overlapping symmetric communities. This gives raise in particular to new algorithmic challenges driven by the thresholds. This paper investigates whether a general phenomenon takes place for multiple communities, without imposing symmetry. In the general stochastic block model SBM(n,p,W), n vertices are split into k communities of relative size {pi}i∈[k], and vertices in community i and j connect independently with probability {Wij}i,j∈[k]. This paper investigates the partial and exact recovery of communities in the general SBM (in the constant and logarithmic degree regimes), and uses the generality of the results to tackle overlapping communities. The contributions of the paper are: (i) an explicit characterization of the recovery threshold in the general SBM in terms of a new f-divergence function D+, which generalizes the Hellinger and Chernoff divergences, and which provides an operational meaning to a divergence function analog to the KL-divergence in the channel coding theorem, (ii) the development of an algorithm that recovers the communities all the way down to the optimal threshold and runs in quasi-linear time, showing that exact recovery has no information-theoretic to computational gap for multiple communities, (iii) the development of an efficient algorithm that detects communities in the constant degree regime with an explicit accuracy bound that can be made arbitrarily close to 1 when a prescribed signal-to-noise ratio [defined in terms of the spectrum of diag(p)W] tends to infinity.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Inference of Population Structure Using Multilocus Genotype Data
Pritchard, J. K., Stephens, M., & Donnelly, P. (2000) · Genetics · doi:10.1093/genetics/155.2.945 · Cited by 33,908
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
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Sørlie, T., Perou, C. M., Tibshirani, R., Aas, T., Geisler, S., Johnsen, H., Hastie, T., Eisen, M. B., van de Rijn, M., Jeffrey, S. S., et al. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.191367098 · Cited by 10,938
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Amazon.com recommendations: item-to-item collaborative filtering
Linden, G., Smith, B., & York, J. (2003) · IEEE Internet Computing · doi:10.1109/mic.2003.1167344 · Cited by 5,403
Image Processing, Analysis and Machine Vision
Sonka, M., Hlavac, V., & Boyle, R. (1993) · Springer eBooks · doi:10.1007/978-1-4899-3216-7 · Cited by 3,717
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
Cited by
Community Detection and Stochastic Block Models
Abbe, E. (2018) · now publishers, Inc. eBooks · doi:10.1561/9781680834772 · Cited by 544
Self-citationGradient Coding Using the Stochastic Block Model
Charles, Z., & Papailiopoulos, D. (2018) · 2018 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437887 · Cited by 23
Metadata
- Authors
- Abbe, E., & Sandon, C.
- Venue
- 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 2015-10
- Pages
- 670-688
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2219655028
- Cited by
- 254
- References
- 55
- FWCI
- 34.65
- Type
- conference paper
- Language
- en
- Open access
- closed
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 in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery. https://app.cochat.ai/papers/10.1109/focs.2015.47
- The paper
- Abbe, E., & Sandon, C. (2015). Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery. 2015 IEEE 56th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/focs.2015.47
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.