Stochastic Block Model and Community Detection in the Sparse Graphs: A spectral algorithm with optimal rate of recovery
Data Structures and Algorithms
2015-06-25 v2
Abstract
In this paper, we present and analyze a simple and robust spectral algorithm for the stochastic block model with blocks, for any 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.
Keywords
Cite
@article{arxiv.1501.05021,
title = {Stochastic Block Model and Community Detection in the Sparse Graphs: A spectral algorithm with optimal rate of recovery},
author = {Peter Chin and Anup Rao and Van Vu},
journal= {arXiv preprint arXiv:1501.05021},
year = {2015}
}