On the hardness of sampling independent sets beyond the tree threshold

We consider local Markov chain Monte–Carlo algorithms for sampling from the weighted distribution of independent sets with activity λ, where the weight of an independent set I is λ|I|. A recent result has established that Gibbs sampling is rapidly mixing in sampling the distribution for graphs of maximum degree d and λ < λc(d), where λc(d) is the critical activity for uniqueness of the Gibbs measure (i.e., for decay of correlations with distance in the weighted distribution over independent sets) on the d-regular infinite tree. We show that for d ≥ 3, λ just above λc(d) with high probability over d-regular bipartite graphs, any local Markov chain Monte–Carlo algorithm takes exponential time before getting close to the stationary distribution. Our results provide a rigorous justification for “replica” method heuristics. These heuristics were invented in theoretical physics and are used in order to derive predictions on Gibbs measures on random graphs in terms of Gibbs measures on trees. A major theoretical challenge in recent years is to provide rigorous proofs for the correctness of such predictions. Our results establish such rigorous proofs for the case of hard-core model on bipartite graphs. We conjecture that λc is in fact the exact threshold for this computational problem, i.e., that for λ > λc it is NP-hard to approximate the above weighted sum over independent sets to within a factor polynomial in the size of the graph.

[1]  S. Ross.  A random graph , 1981 .

[2]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .

[3]  M. Mézard,et al.  A replica analysis of the travelling salesman problem , 1986 .

[4]  M. Mézard,et al.  On the solution of the random link matching problems , 1987 .

[5]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

[6]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[7]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[8]  Eric Vigoda,et al.  Approximately counting up to four (extended abstract) , 1997, STOC '97.

[9]  Hanna D. Robalewska,et al.  1-Factorizations of random regular graphs , 1997, Random Struct. Algorithms.

[10]  Daniel A. Spielman,et al.  Analysis of low density codes and improved designs using irregular graphs , 1998, STOC '98.

[11]  N. Wormald,et al.  Models of the , 2010 .

[12]  Martin E. Dyer,et al.  On counting independent sets in sparse graphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[13]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[14]  Martin E. Dyer,et al.  On Markov Chains for Independent Sets , 2000, J. Algorithms.

[15]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[16]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[17]  Yuval Peres,et al.  Glauber dynamics on trees and hyperbolic graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[18]  Elchanan Mossel,et al.  Glauber dynamics on trees and hyperbolic graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[19]  D. Aldous.  The ζ(2) limit in the random assignment problem , 2000, Random Struct. Algorithms.

[20]  Eric Vigoda,et al.  A Note on the Glauber Dynamics for Sampling Independent Sets , 2001, Electron. J. Comb..

[21]  Martin E. Dyer,et al.  On Counting Independent Sets in Sparse Graphs , 2002, SIAM J. Comput..

[22]  M. Mézard,et al.  Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.

[23]  Michel Talagrand,et al.  The generalized Parisi formula , 2003 .

[24]  Peter Winkler,et al.  A second threshold for the hard‐core model on a Bethe lattice , 2004, Random Struct. Algorithms.

[25]  L. A. Goldberg,et al.  Random sampling of 3-colorings in Z 2 , 2004 .

[26]  Fabio Martinelli,et al.  Fast mixing for independent sets, colorings, and other models on trees , 2004, SODA '04.

[27]  Dror Weitz,et al.  Counting independent sets up to the tree threshold , 2006, STOC '06.

[28]  M. Talagrand.  The parisi formula , 2006 .

[29]  Andrea Montanari,et al.  Reconstruction for Models on Random Graphs , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[30]  Elchanan Mossel,et al.  Gibbs rapidly samples colorings of G(n, d/n) , 2007, 0707.3241.

[31]  A. Sinclair,et al.  Fast mixing for independent sets, colorings, and other models on trees , 2007 .

[32]  Elchanan Mossel,et al.  Rapid mixing of Gibbs sampling on graphs that are sparse on average , 2007, SODA '08.