The Glauber dynamics for colourings of bounded degree trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 631-645

  Lucier, Brendan ^a   Molloy, Michael ^a   Peres, Yuval ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK DYNAMICS; BOUNDED DEGREE TREES; CONSTANT FACTORS; GLAUBER DYNAMICS; MARKOV CHAIN; MAXIMUM DEGREE; MIXING TIME;

COMBINATORIAL OPTIMIZATION; MARKOV PROCESSES; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70350600913     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_47     Document Type: Conference Paper

References (19)

1. Berger, N., Kenyon, C., Mossel, E., Peres, Y.: Glauber dynamics on trees and hyperbolic graphs. Prob. Th. Related Fields 131, 311-340 (2005)
2. Brightwell, G., Winkler, P.: Random colorings of a Cayley tree. In: Bollobás, B. (ed.) Contemporary Combinatorics. Bolyai Society Mathematical Studies, vol. 10, pp. 247-276 (2002)
3. Diaconis, P., Saloff-Coste, L.: Comparison theorems for reversible Markov chains. Ann. Appl. Prob. 3, 696-730 (1993)
4. Diaconis, P., Stroock, D.: Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Prob. 1, 36-61 (1991)
5. Dyer, M., Goldberg, L., Jerrum, M.: Systematic scan for sampling colorings. Ann. Appl. Prob. 18, 185-230 (2006)
6. Goldberg, L., Jerrum, M., Karpinski, M.: The mixing time of Glauber dynamics for colouring regular trees (2008) arXiv:0806.0921v1
7. Hayes, T., Vera, J., Vigoda, E.: Randomly coloring planar graphs with fewer colors than the maximum degree. In: Proceedings of STOC 2007 (2007)
8. Jerrum, M.: A very simple algorithm for estimating the number of k-colourings of a low-degree graph. Rand. Struct. Alg. 7, 157-165 (1995)
9. Jerrum, M., Sinclair, A.: Approximating the permanent. Siam. Jour. Comput. 18, 1149-1178 (1989)
10. Jonasson, J.: Uniqueness of uniform random colourings of regular trees. Stat. & Prob. Letters 57, 243-248 (2002)
11. Jordan, C.: Sur les assemblages de lignes. J. Reine Angew. Math. 70, 185-190 (1869)
12. Martinelli, F.: Lectures on Glauber dynamics for discrete spin models. Lecture Notes in Mathematics, vol. 1717 (2000)
13. Lucier, B., Molloy, M.: The Glauber dynamics for colourings of bounded degree trees. Submitted to journal (2008)
14. Martinelli, F., Sinclair, A., Weitz, D.: Fast mixing for independent sets, colorings and other models on trees. Rand. Struc. & Alg. 31, 134-172 (2007)
15. Molloy, M.: Very rapidly mixing Markov Chains for (2Δ)-colourings and for independent sets in a 4-regular graph. Rand. Struc. & Alg. 18, 101-115 (2001)
16. Mossel, E., Sly, A.: Gibbs Rapidly Samples Colourings of G(n,d/n) (2007), http://front.math.ucdavis.edu/0707.3241
17. Randall, D.: Mixing. In: Proceedings of FOCS 2003 (2003)
18. Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing 1, 351-370 (1992)
19. Vigoda, E.: Improved bounds for sampling colorings. J. Math. Physics 41, 1555-1569 (2000)