mlsanityData to 7 Oct 2026

Stochastic Block Model and Community Detection in the Sparse Graphs: A spectral algorithm with optimal rate of recovery

arXiv 1501.05021 ↗First posted 20 Jan 2015cs.DScited by 15

Not on the map. Why?

Abstract (arXiv)

In this paper, we present and analyze a simple and robust spectral algorithm for the stochastic block model with k blocks, for any k fixed. Our algorithm works with graphs having constant edge density, under an optimal condition on the gap between the density inside a block and the density between the blocks. As a co-product, we settle an open question posed by Abbe et. al. concerning censor block models.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Jan 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 4; 2023: 4; 2024: 2; 2025: 1; 2026: 2.

15 papers.

Sort: