On the hardness of sampling independent sets beyond the tree threshold

Probability Theory and Related Fields

Volumn 143, Issue 3-4, 2009, Pages 401-439

  Mossel, Elchanan ^a   Weitz, Dror ^b   Wormald, Nicholas ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 59449106512     PISSN: 01788051     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00440-007-0131-9     Document Type: Article

References (25)

1. D. Aldous 2001 The ζ(2) limit in random assignment problem Random Struct. Algorithms 18 381 418
2. N. Berger C. Kenyon E. Mossel Y. Peres 2005 Glauber dynamics on trees and hyperbolic graphs Probab. Theory Relat. Fields 131 311 340
3. G. Brightwell P. Winkler 2004 A second threshold for the hard-core model on a Bethe lattice Random Struct. Algorithms 24 303 314
4. Dyer, M., Frieze, A., Jerrum, M.: On counting independent sets in sparse graphs. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 210-217 (1999)
5. M. Dyer C. Greenhill 2000 On Markov chains for independent sets J. Algorithms 35 17 49
6. Gershchenfeld, A., Montanari, A.: Reconstruction for models on random graphs. Availible at the Arxiv at 0704.3293v1.pdf
7. M. Jerrum A. Sinclair 1993 Polynomial time approximation algorithms for the Ising model SIAM J. Comput. 22 1087 1116
8. Janson, S., Luczak, T., Ruciński, A.: Random Graphs. Wiley, New York (2000)
9. F.P. Kelly 1985 Stochastic models of computer communication systems J. R. Stat. Soc. B 47 379 395
10. Luby, M., Vigoda, E.: Approximately counting up to four. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 682-687 (1997)
11. Luby, M., Mitzenmacher, M., Shokrollahi, M.A., Spielman, D.: Analysis of low density parity check codes and improved designs using irregular graphs. In: Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 249-258 (1998)
12. M. Mézard G. Parisi 1986 A replica analysis of the travelling salesman problem J. Phys. 47 1285 1296
13. M. Mézard G. Parisi 1987 On the solution of the random link matching problem J. Phys. 48 1451 1459
14. Mézard, M., Parisi, G., Virasoro, M.: Spin glass theory and beyond. World Scientific Lecture Notes in Physics, vol. 9. World Scientific Publishing, Cleveland (1991)
15. M. Mézard G. Parisi R. Zecchina 2002 Analytic and algorithmic solution of random satisfiability problems Science 297 812
16. Martinelli, F., Sinclair, A., Weitz, D.: Fast mixing for independent sets, colorings and other models on trees. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 456-465 (2004)
17. M. Molloy H. Robalewska R.W. Robinson N.C. Wormald 1997 1-Factorisations of random regular graphs Random Struct. Algorithms 10 305 321
18. Mossel, E., Sly, A.: Rapid mixing of Gibbs sampling on graphs that are sparse on average. In: To appear in proceedings of SODA 2008. http://front.math.ucdavis.edu/0707.3241 (2008, to appear)
19. Mossel, E., Sly, A.: Gibbs rapidly samples colorings of G(n, d/n). Preprint http://front.math.ucdavis.edu/0707.3241 (2007)
20. T. Richardson A. Shokrollahi R. Urbanke 2001 Design of capacity-approaching irregular low-density parity check codes IEEE Trans. Inform. Theory 47 619 637
21. Sinclair, A.: Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhuser, Boston (1993)
22. M. Talagrand 2003 The Parisi formul Ann. Math. (2) 163 1 221 263
23. Vigoda, E.: A note on the Glauber dynamics for sampling independent sets. Electron. J. Combinat. 8(1), (2001)
24. Weitz, D.: Counting independent sets up to the tree threshold. In: Proceedings of the 38th ACM Symposium on the Theory of Computing, pp. 140-149 (2006)
25. Wormald, N.C.: Models of random regular graphs. In: Lamb, J.D., Preece, D.A.(eds) Surveys in Combinatorics, 1999 (Canterbury), pp. 239-298. Cambridge University Press, Cambridge (1999)