# Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery

## Author(s): Abbe, Emmanuel; Sandon, C

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr19566
 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 siz{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 Chern off 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 term of the spectrum of diag(p)W tends to infinity. Publication Date: 2015 Electronic Publication Date: 2015 Citation: Abbe, E, Sandon, C. (2015). Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery. 2015-December (670 - 688. doi:10.1109/FOCS.2015.47 DOI: doi:10.1109/FOCS.2015.47 Pages: 670 - 688 Type of Material: Conference Article Journal/Proceeding Title: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS Version: Author's manuscript

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.