Belief propagation, robust reconstruction and optimal recovery of block models

We consider the problem of reconstructing sparse symmetric block models with two blocks and connection probabilities a=n and b=n for inter- and intra-block edge probabilities respectively. It was recently shown that one can do better than a random guess if and only if (a b) 2 > 2(a + b). Using a variant of Belief Propagation, we give a reconstruction algorithm that is optimal in the sense that if (a b) 2 > C(a + b) for some constant C then our algorithm maximizes the fraction of the nodes labelled correctly. Along the way we prove some results of independent interest regarding robust reconstruction for the Ising model on regular and Poisson trees.

[1]  Y. Peres,et al.  Broadcasting on trees and the Ising model , 2000 .

[2]  Elchanan Mossel,et al.  Robust reconstruction on trees is determined by the second eigenvalue , 2004, math/0406447.

[3]  Martin E. Dyer,et al.  The Solution of Some Random NP-Hard Problems in Polynomial Expected Time , 1989, J. Algorithms.

[4]  T. Snijders,et al.  Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure , 1997 .

[5]  Frank Thomson Leighton,et al.  Graph bisection algorithms with good average case behavior , 1984, Comb..

[6]  H. Kesten,et al.  Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes , 1966 .

[7]  Elchanan Mossel,et al.  Robust dimension free isoperimetry in Gaussian space , 2012, 1202.4124.

[8]  D. Welsh,et al.  A Spectral Technique for Coloring Random 3-Colorable Graphs , 1994 .

[9]  John W. Fisher,et al.  Loopy Belief Propagation: Convergence and Effects of Message Errors , 2005, J. Mach. Learn. Res..

[10]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[11]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[12]  Elchanan Mossel,et al.  Spectral redemption in clustering sparse networks , 2013, Proceedings of the National Academy of Sciences.

[13]  J. Lumley.  AUSTRALIA , 1920, The Lancet.

[14]  J. Ruiz,et al.  On the purity of the limiting gibbs state for the Ising model on the Bethe lattice , 1995 .

[15]  Joel H. Spencer,et al.  Coloring Random and Semi-Random k-Colorable Graphs , 1995, J. Algorithms.

[16]  Jure Leskovec,et al.  Statistical properties of community structure in large social and information networks , 2008, WWW.

[17]  Richard M. Karp,et al.  Algorithms for graph partitioning on the planted partition model , 1999, Random Struct. Algorithms.

[18]  Amin Coja-Oghlan,et al.  Graph Partitioning via Adaptive Spectral Techniques , 2009, Combinatorics, Probability and Computing.

[19]  Ravi B. Boppana,et al.  Eigenvalues and graph bisection: An average-case analysis , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[20]  Frank McSherry,et al.  Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[21]  P. Bickel,et al.  A nonparametric view of network models and Newman–Girvan and other modularities , 2009, Proceedings of the National Academy of Sciences.

[22]  Elchanan Mossel,et al.  The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[23]  Noga Alon,et al.  A Spectral Technique for Coloring Random 3-Colorable Graphs , 1997, SIAM J. Comput..

[24]  Frank Thomson Leighton,et al.  Graph Bisection Algorithms with Good Average Case Behavior , 1984, FOCS.

[25]  Laurent Massoulié,et al.  Community detection thresholds and the weak Ramanujan property , 2013, STOC.

[26]  Allan Sly,et al.  Reconstruction for the Potts model , 2009, STOC '09.

[27]  Elchanan Mossel,et al.  Reconstruction and estimation in the planted partition model , 2012, Probability Theory and Related Fields.

[28]  Cristopher Moore,et al.  Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Andrea Montanari,et al.  The weak limit of Ising models on locally tree-like graphs , 2009, 0912.0719.

[30]  Richard M. Karp,et al.  Algorithms for graph partitioning on the planted partition model , 2001, Random Struct. Algorithms.

[31]  Mark Jerrum,et al.  The Metropolis Algorithm for Graph Bisection , 1998, Discret. Appl. Math..