The mixing time of Glauber dynamics for coloring regular trees

Random Structures and Algorithms

Volumn 36, Issue 4, 2010, Pages 464-476

  Goldberg, Leslie Ann ^a   Jerrum, Mark ^b   Karpinski, Marek ^c  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^c UNIVERSITY OF BONN   (Germany)

Author keywords

Coloring trees; Glauber dynamics; Mixing time

Indexed keywords

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

References (21)

1. D. J. Aldous, Some inequalities for reversible Markov chains, J London Math Soc 25 (1982), 564-576.
2. N. Berger, C. Kenyon, E. Mossel, and Y. Peres, Glauber dynamics on trees and hyperbolic graphs, Probab Theo Relat Field 131 (2005), 311-340.
3. N. Bhatnagar, J. Vera, and E. Vigoda, Reconstruction for colorings on trees, arxiv:0711.3664, 2007.
4. P. Diaconis and L. Saloff-Coste, Comparison theorems for reversible Markov chains, Ann Appl Probab 3 (1993), 696-730.
5. P. Diaconis and D. Stroock, Geometric bounds for eigenvalues of Markov chains, Ann Appl Probab 1 (1991), 36-61.
6. M. Dyer, A. D. Flaxman, A. M. Frieze, and E. Vigoda, Randomly coloring sparse random graphs with fewer colors than the maximum degree, Random Struct Algorithm 29 (2006), 450-465.
7. M. Dyer, A. Frieze, and M. Jerrum, On counting independent sets in sparse graphs, SIAM J Comput 31 (2002), 1527-1541.
8. M. Dyer, L. A. Goldberg, M. Jerrum, and R. Martin, Markov chain comparison, Probab Surv 3 (2006),89-111 (electronic).
9. L. A. Goldberg, R. Martin, and M. Paterson, Random sampling of 3-colorings in Z2, Random Struct Algorithm 24 (2004), 279-302.
10. T. P. Hayes, J. C. Vera, and E. Vigoda, Randomly coloring planar graphs ith fewer colors than the maximum degree, In STOC'07-Proceedings of the 39th Annual ACM Symposium on Theory of Computing, ACM, New York, 2007, pp. 450-458.
11. M. Luby, D. Randall, and A. Sinclair, Markov chain algorithms for planar lattice structures, SIAM J Comput 31 (2001), 167-192.
12. B. Lucier, M. Molloy, and Y. Peres, The Glauber dynamics for colorings of bounded degree trees, Approximation, randomization and combinatorial optimization, volume 5687 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2009, pp. 631-645.
13. F. Martinelli, Lectures on Glauber dynamics for discrete spin models,In Lectures on probability theory and statistics (Saint-Flour, 1997), Lecture Notes in Math, Vol. 1717, Springer, Berlin, 1999, pp. 93-191.
14. F. Martinelli, A. Sinclair, and D. Weitz, Fast mixing for independent sets, colorings, and other models on trees, Random Struct Algorithm 31 (2007), 134-172.
15. E. Mossel, Survey: Information flow on trees, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 63, AMS Press, 2004, pp. 155-170.
16. E. Mossel, Recursive reconstruction on periodic trees, Random Struct Algorithm 13 (1998), 81-97.
17. D. Randall and P. Tetali, Analyzing Glauber dynamics by comparison of Markov chains, JMathPhys41 (2000), 1598-1615.Probabilistic techniques in equilibrium and nonequilibrium statistical physics.
18. A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combin Probab Comput 1 (1992), 351-370.
19. A. Sinclair and M. Jerrum, Approximate counting, uniform generation and rapidly mixing Markov chains, Inform Comput 82 (1989), 93-133.
20. P. Tetali, J. C. Vera, E. Vigoda, and L. Yang, Phase transition for the mixing time of the Glauber dynamics for coloring regular trees. arXiv:0908.2665v1, 2009.
21. D. Weitz, Mixing in time and space for discrete spin systems, PhD thesis, CS Division, U.C. Berkeley, 2004.