Belief propagation, robust reconstruction and optimal recovery of block models

Journal of Machine Learning Research

Volumn 35, Issue , 2014, Pages 356-370

  Mossel, Elchanan ^a   Neeman, Joe ^b,c   Sly, Allan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b The University of Texas at Austin   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; SOFTWARE ENGINEERING;

BELIEF PROPAGATION; BLOCK EDGES; BLOCK MODELS; CONNECTION PROBABILITY; OPTIMAL RECOVERY; RECONSTRUCTION ALGORITHMS; ROBUST RECONSTRUCTION;

ISING MODEL;

EID: 84939631838     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (25)

1. P. J. Bickel and A. Chen. A nonparametric view of network models and Newman-Girvan and other modularities. Proceedings of the National Academy of Sciences, 106(50):21068-21073, 2009.
2. P. M. Bleher, J. Ruiz, and V. A. Zagrebnov. On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice. J. Statist. Phys., 79(1-2):473-482, 1995.
3. C. Borgs, J. Chayes, E. Mossel, and S. Roch. The Kesten-Stigum reconstruction bound is tight for roughly symmetric binary channels. In Proceedings of IEEE FOCS 2006, pages 518-530, 2006.
4. T. N. Bui, S. Chaudhuri, F. T. Leighton, and M. Sipser. Graph bisection algorithms with good average case behavior. Combinatorica, 7(2):171-191, 1987.
5. A. Coja-Oghlan. Graph partitioning via adaptive spectral techniques. Combinatorics, Probability and Computing, 19(02):227-284, 2010.
6. A. Condon and R. M. Karp. Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms, 18(2):116-140, 2001.
7. A. Decelle, F. Krzakala, C. Moore, and L. Zdeborová. Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications. Physics Review E, 84:066106, Dec. 2011.
8. M. E. Dyer and A. M. Frieze. The solution of some random NP-hard problems in polynomial expected time. Journal of Algorithms, 10(4):451-489, 1989.
9. W. S. Evans, C. Kenyon, Yuval Y. Peres, and L. J. Schulman. Broadcasting on trees and the Ising model. Ann. Appl. Probab., 10(2):410-433, 2000.
10. P. W. Holland, K. B. Laskey, and S. Leinhardt. Stochastic blockmodels: First steps. Social Networks, 5(2):109-137, 1983. ISSN 0378-8733.
11. Alexander T Ihler, John Iii, and Alan S Willsky. Loopy belief propagation: Convergence and effects of message errors. In Journal of Machine Learning Research, pages 905-936, 2005.
12. S. Janson and E. Mossel. Robust reconstruction on trees is determined by the second eigenvalue. Ann. Probab., 32:2630-2649, 2004.
13. M. Jerrum and G. B. Sorkin. The Metropolis algorithm for graph bisection. Discrete Applied Mathematics, 82(1-3):155-175, 1998.
14. H. Kesten and B. P. Stigum. Additional limit theorems for indecomposable multidimensional Galton-Watson processes. Ann. Math. Statist., 37:1463-1481, 1966.
15. Florent Krzakala, Cristopher Moore, Elchanan Mossel, Joe Neeman, Allan Sly, Lenka Zdeborov, and Pan Zhang. Spectral redemption in clustering sparse networks. Proceedings of the National Academy of Sciences, 110(52):20935-20940, 2013.
16. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In Proceeding of the 17th international conference on World Wide Web, pages 695-704. ACM, 2008.
17. L. Massoulié. Community detection thresholds and the weak Ramanujan property. arXiv:1311:3085, 2014.
18. F. McSherry. Spectral partitioning of random graphs. In 42nd IEEE Symposium on Foundations of Computer Science, pages 529-537. IEEE, 2001.
19. Andrea Montanari, Elchanan Mossel, and Allan Sly. The weak limit of Ising models on locally tree-like graphs. Probability Theory and Related Fields, 152:31-51, 2012.
20. E. Mossel, J. Neeman, and A. Sly. Stochastic block models and reconstruction. arXiv:1202.4124, 2013.
21. Elchanan Mossel, Joe Neeman, and Allan Sly. A proof of the block model threshold conjecture. arXiv:1311.4115, 2014a.
22. Elchanan Mossel, Joe Neeman, and Allan Sly. Belief propagation, robust reconstruction, and optimal recovery of block models. arXiv:1309.1380, 2014b.
23. A. Sly. Reconstruction for the Potts model. Annals of Probability, 39(4):1365-1406, 2011.
24. T. A. B. Snijders and K. Nowicki. Estimation and prediction for stochastic blockmodels for graphs with latent block structure. Journal of Classification, 14(1):75-100, 1997.
25. S. H. Strogatz. Exploring complex networks. Nature, 410(6825):268-276, 2001.