Fast mixing for independent sets, colorings, and other models on trees

Random Structures and Algorithms

Volumn 31, Issue 2, 2007, Pages 134-172

  Martinelli, Fabio ^a   Sinclair, Alistair ^b   Weitz, Dror ^c  

^a ROMA TRE UNIVERSITY   (Italy)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Glauber dynamics; Markov chain Monte Carlo algorithms; Mixing time; Phase transitions; Reconstruction on trees

Indexed keywords

EID: 34548542393     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20132     Document Type: Article

References (32)

1. R. J. Baxter, Exactly solved models in statistical mechanics, Academic Press, London, 1982.
2. N. Berger, C. Kenyon, E. Mossel, and Y. Peres, "Glauber dynamics on trees and hyperbolic graphs," Probab Theor Relat Fields 131 (2005), 311-340.
3. P. Bleher, J. Ruiz, R. H. Schonmann, S. Shlosman, and V. Zagrebnov, Rigidity of the critical phases on a Cayley tree, Moscow Math J 1 (2001), 345-363.
4. G. R. Brightwell and P. Winkler, "Random colorings of a Cayley tree," Contemporary combinatorics, Bolyai Soc Math Studies 10, János Bolyai Math Soc, Budapest, 2002, pp. 247-276.
5. G. R. Brightwell and P. Winkler, A second threshold for the hard-core model on a Bethe lattice, Random Struct Algor 24 (2004), 303-314.
6. M. Dyer and A. Frieze, "Randomly colouring graphs with lower bounds on girth and maximum degree," Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, 2001, pp. 579-587.
7. M. Dyer, A. Frieze, T. P. Hayes, and E. Vigoda, "Randomly colouring constant degree graphs," Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, 2004, pp. 582-589.
8. W. Evans, C. Kenyon, Y. Peres, and L. J. Schulman, Broadcasting on trees and the Ising model, Ann Appl Probab 10 (2000), 410-433.
9. H.-O. Georgii, Gibbs measures and phase transitions, de Gruyter, Berlin, 1988.
10. O. Häggström, The random-cluster model on a homogeneous tree, Probab Theor Relat Fields 104 (1996), 231-253.
11. T. P. Hayes, "Randomly coloring graphs with girth five," Proceedings of the 35th ACM Symposium on Theory of Computing, 2003, pp. 269-278.
12. T. P. Hayes and E. Vigoda, "A non-Markovian coupling for randomly sampling colorings," Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, 2003, pp. 618-627.
13. M. Jerrum, J.-B. Son, P. Tetali, and E. Vigoda, "Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains," Ann Appl Probabil 14 (2004), 1741-1765.
14. J. Jonasson, Uniqueness of uniform random colorings of regular trees, Statist Probab Lett 57 (2002), 243-248.
15. F. P. Kelly, Stochastic models of computer communication systems, J R Stat Soc B 47 (1985), 379-395.
16. M. Luby and E. Vigoda, Fast convergence of the Glauber dynamics for sampling independent sets, Random Struct Algor 15 (1999), 229-241.
17. R. Lyons, Phase transitions on non amenable graphs, J Math Phys 41 (2000), 1099-1127.
18. J. B. Martin, "Reconstruction thresholds on regular trees," Proceedings of Discrete Random Walks, DRW'03, C. Banderier and C. Krattenthaler (Editors), Discrete Mathematics and Theoretical Computer Science Proceedings Vol. AC, 2003, pp. 191-204.
19. F. Martinelli, "Lectures on Glauber dynamics for discrete spin models," Lectures on Probability Theory and Statistics (Saint-Flour, 1997), Lecture notes in Mathematics 1717, Springer, Berlin, 1998. pp. 93-191.
20. F. Martinelli, A. Sinclair, and D. Weitz, "The Ising model on trees: Boundary conditions and mixing time," Tech Report UCB//CSD-03-1256, Dept. of EECS, UC Berkeley, July 2003. Available from http://sunsite.Berkeley.EDU/ NCSTRL/ Slightly modified version under the title "Glauber dynamics on trees: boundary conditions and mixing time" appeared in. Commun Math Phys 250 (2004), 301-334.
21. M. Molloy, "The Glauber dynamics on colorings of a graph with high girth and maximum degree," Proceedings of the 34th ACM Symposium on Theory of Computing, 2002, pp. 91-98.
22. E. Mossel, "Survey: Information flow on trees," Graphs, Morphisms and Statistical Physics, J. Nešetřil and P. Winkler (Editors), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 2004, pp. 155-170.
23. E. Mossel and Y. Peres, Information flow on trees, Ann Appl Probab 13 (2003), 817-844.
24. R. B. Potts, Some generalized order-disorder transformations, Proc Cambridge Phil Soc 48 (1952), 106-109.
25. C. J. Preston, Gibbs states on countable sets, Cambridge University Press, London, 1974.
26. L. Saloff-Coste, "Lectures on finite Markov chains," Lectures on probability theory and statistics (Saint-Flour, 1996), Lecture notes in Mathematics 1665, Springer, Berlin, 1997, pp. 301-413.
27. F. Spitzer, Markov random fields on an infinite tree, Ann Probab 3 (1975), 387-398.
28. E. Vigoda, Improved bounds for sampling colorings, J Math Phys 41 (2000), 1555-1569.
29. E. Vigoda, A note on the Glauber dynamics for sampling independent sets, Elect J Combinator 8(1) (2001).
30. D. Weitz, "Combinatorial criteria for uniqueness of the Gibbs measure," Random Struct Algor 27 (2005), 445-475.
31. D. Weitz, "Mixing in time and space for discrete spin systems," Ph.D. dissertation, University of California at Berkeley, May 2004.
32. F. Y. Wu, The Potts model, Rev Mod Phys 54 (1982), 235-268.