The Glauber dynamics on colorings of a graph with high girth and maximum degree

SIAM Journal on Computing

Volumn 33, Issue 3, 2004, Pages 721-737

  Molloy, Michael ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Colorings; Glauber dynamics; Rapidly mixing Markov chains

Indexed keywords

ASYMPTOTIC STABILITY; BOUNDARY VALUE PROBLEMS; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

COLORINGS; GLAUBER DYNAMICS; PATH-COUPLING TECHNIQUE; RAPIDLY MIXING MARKOVIAN CHAINS;

GRAPH THEORY;

EID: 3142755843     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702401786     Document Type: Article

References (13)

1. R. BUBLEY AND M. DYER, Path coupling: A technique for proving rapid mixing in Markov chains, in Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1997, pp. 223-231.
2. M. DYER AND A. FRIEZE, Randomly coloring graphs with lower bounds on girth and maximum degree, Random Structures Algorithms, 23 (2003), pp. 167-179.
3. M. DYER, L. GOLDBERG, C. GREENHILL, M. JERRUM, AND M. MITZENMACHER, An extension of path coupling and its application to the Glauber dynamics for path colorings, in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 2000, pp. 355-363.
4. M. DYER AND C. GREENHILL, Random walks on combinatorial objects, in Surveys in Combinatorics, 1999, J. D. Lamb and D. A. Preece, eds., Cambridge University Press, Cambridge, UK, 1999, pp. 101-136.
5. M. DYER, C. GREENHILL, AND M. MOLLOY, Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs, Random Structures Algorithms, 20 (2002), pp. 98-114.
6. T. HAYES AND E. VIGODA, A non-Markovian coupling for sampling colorings, in Proceedings of FOCS 2003, Boston, MA, 2003.
7. M. JERRUM, A very simple algorithm for estimating the number of k-colorings of a low-degree graph, Random Structures Algorithms, 7 (1995), pp. 157-165.
8. M. JERRUM, Mathematical foundations of the Markov chain Monte Carlo method, in Probabilistic Methods for Algorithmic Discrete Mathematics, M. Habib, C. McDiarmid, J. Ramirez-Alfosin, and B. Reed, eds., Springer, Berlin, 1998, pp. 116-165.
9. M. MOLLOY, Very rapidly mixing Markov Chains for 2Δ-colorings and for independent sets in a graph, Random Structures Algorithms, 18 (2001), pp. 101-115.
10. M. MOLLOY, The Glauber dynamics on the colorings of a graph with large girth and maximum degree, in Proceedings of STOC 2002, Montreal, QB, Canada, 2002.
11. J. SALAS AND A. SOKAL, Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem, J. Statist. Phys., 86 (1997), pp. 551-579.
12. J. VAN DEN BERG AND J. STEIF, Percolation and the hard-core lattice gas model, Stochastic Process. Appl., 49 (1994), pp. 179-197.
13. E. VIGODA, Improved bounds for sampling colorings, J. Math. Phys., 41 (2000), pp. 1555-1569.