Recovering asymmetric communities in the stochastic block model

W. Evans, C. Kenyon, Y. Peres, and L. J. Schulman, “Broadcasting on trees and the ising model,” Annals of Applied Probability , pp. 410–433, 2000

2000

Earlier work this paper cites.

E. Mossel and Y. Peres, “Information flow on trees,” The Annals of Applied Probability , vol. 13, no. 3, pp. 817–844, 2003

2003

Earlier work this paper cites.

E. Mossel, “Survey-information flow on trees,” DIMACS series in discrete mathematics and theoretical computer science , vol. 63, pp. 155–170, 2004

2004

Earlier work this paper cites.

A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová, “Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications,” Physical Review E , vol. 84, no. 6, p. 066106, 2011

2011

Earlier work this paper cites.

S. Heimlicher, M. Lelarge, and L. Massoulié, “Community detection in the labelled stochastic block model,” arXiv preprint arXiv:1209.2910 , 2012

Original

2012

Earlier work this paper cites.

E. Mossel, J. Neeman, and A. Sly, “A proof of the block model threshold conjecture,” arXiv preprint arXiv:1311.4115 , 2013

Original

2013

Earlier work this paper cites.

L. Massoulié, “Community detection thresholds and the weak ramanujan property,” in Proceedings of the 46th Annual ACM Symposium on Theory of Computing . ACM, 2014, pp. 694–703

2014

Cited alongside, same era.

J. Neeman and P. Netrapalli, “Non-reconstructability in the stochastic block model,” arXiv preprint arXiv:1404.6304 , 2014

Original

2014

Cited alongside, same era.

V. Kanade, E. Mossel, and T. Schramm, “Global and local information in clustering labeled block models,” 2014

2014

Cited alongside, same era.

E. Mossel, J. Neeman, and A. Sly, “Reconstruction and estimation in the planted partition model,” Probability Theory and Related Fields , vol. 162, no. 3-4, pp. 431–461, 2015

2015

Cited alongside, same era.

C. Bordenave, M. Lelarge, and L. Massoulié, “Non-backtracking spectrum of random graphs: community detection and non-regular ramanujan graphs,” in Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on . IEEE, 2015, pp. 1347–1357

M. Lelarge, L. Massoulié, and J. Xu, “Reconstruction in the labelled stochastic block model,” IEEE Transactions on Network Science and Engineering , vol. 2, no. 4, pp. 152–163, 2015

2015

Later among the works it cites.

A. Montanari, “Finding one community in a sparse graph,” Journal of Statistical Physics , vol. 161, no. 2, pp. 273–299, 2015

2015

Later among the works it cites.

A. Saade, M. Lelarge, F. Krzakala, and L. Zdeborová, “Clustering from sparse pairwise measurements,” arXiv preprint arXiv:1601.06683 , 2016

Original

2016

Closest in time.

A. Saade, F. Krzakala, M. Lelarge, and L. Zdeborová, “Fast randomized semi-supervised clustering,” arXiv preprint arXiv:1605.06422 , 2016

Original

2016

Closest in time.

F. Krzakala, J. Xu, and L. Zdeborová, “Mutual information in rank-one matrix estimation,” arXiv preprint arXiv:1603.08447 , 2016