# Recovering a Hidden Community Beyond the Kesten-Stigum Threshold in O(|E| log^*|V|) Time

arXiv: https://arxiv.org/abs/1510.02786 · HTML: https://mlsanity.com/paper/1510.02786/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 Oct 2015.

## Built on by (most cited first, 1 of 1)

- [Spectral Algorithms Optimally Recover Planted Sub-structures](https://mlsanity.com/paper/2203.11847/) (2022)

## Abstract (arXiv)

Community detection is considered for a stochastic block model graph of n vertices, with K vertices in the planted community, edge probability p for pairs of vertices both in the community, and edge probability q for other pairs of vertices. The main focus of the paper is on weak recovery of the community based on the graph G, with o(K) misclassified vertices on average, in the sublinear regime n1-o(1) ≤ K ≤ o(n). A critical parameter is the effective signal-to-noise ratio λ=K2(p-q)2/((n-K)q), with λ=1 corresponding to the Kesten-Stigum threshold. We show that a belief propagation algorithm achieves weak recovery if λ>1/e, beyond the Kesten-Stigum threshold by a factor of 1/e. The belief propagation algorithm only needs to run for log^ast n+O(1)  iterations, with the total time complexity O(|E| log^*n), where log^*n is the iterated logarithm of n. Conversely, if λ ≤ 1/e, no local algorithm can asymptotically outperform trivial random guessing. Furthermore, a linear message-passing algorithm that corresponds to applying power iteration to the non-backtracking matrix of the graph is shown to attain weak recovery if and only if λ>1. In addition, the belief propagation algorithm can be combined with a linear-time voting procedure to achieve the information limit of exact recovery (correctly classify all vertices with high probability) for all K ≥ fracnlog n left( ρrm BP +o(1) right), where ρrm BP is a function of p/q.