We study the Glauber dynamics Markov chain for k-colourings of trees with maximum degree Δ. For k ≥ 3, we show that the mixing time on every tree is at most n O(1 + Δ/(k logΔ)). This bound is tight up to the constant factor in the exponent, as evidenced by the complete tree. Our proof uses a weighted canonical paths analysis and a variation of the block dynamics that exploits the differing relaxation times of blocks.


Planar Graph Maximum Degree Boundary Node Glauber Dynamic Proper Colouring 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Berger, N., Kenyon, C., Mossel, E., Peres, Y.: Glauber dynamics on trees and hyperbolic graphs. Prob. Th. Related Fields 131, 311–340 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 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)Google Scholar
  3. 3.
    Diaconis, P., Saloff-Coste, L.: Comparison theorems for reversible Markov chains. Ann. Appl. Prob. 3, 696–730 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Diaconis, P., Stroock, D.: Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Prob. 1, 36–61 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Dyer, M., Goldberg, L., Jerrum, M.: Systematic scan for sampling colorings. Ann. Appl. Prob. 18, 185–230 (2006)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Goldberg, L., Jerrum, M., Karpinski, M.: The mixing time of Glauber dynamics for colouring regular trees (2008) arXiv:0806.0921v1 Google Scholar
  7. 7.
    Hayes, T., Vera, J., Vigoda, E.: Randomly coloring planar graphs with fewer colors than the maximum degree. In: Proceedings of STOC 2007 (2007)Google Scholar
  8. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Jerrum, M., Sinclair, A.: Approximating the permanent. Siam. Jour. Comput. 18, 1149–1178 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Jonasson, J.: Uniqueness of uniform random colourings of regular trees. Stat. & Prob. Letters 57, 243–248 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Jordan, C.: Sur les assemblages de lignes. J. Reine Angew. Math. 70, 185–190 (1869)CrossRefzbMATHGoogle Scholar
  12. 12.
    Martinelli, F.: Lectures on Glauber dynamics for discrete spin models. Lecture Notes in Mathematics, vol. 1717 (2000) Google Scholar
  13. 13.
    Lucier, B., Molloy, M.: The Glauber dynamics for colourings of bounded degree trees. Submitted to journal (2008)Google Scholar
  14. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Mossel, E., Sly, A.: Gibbs Rapidly Samples Colourings of G(n,d/n) (2007),
  17. 17.
    Randall, D.: Mixing. In: Proceedings of FOCS 2003 (2003)Google Scholar
  18. 18.
    Sinclair, A.: Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing 1, 351–370 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Vigoda, E.: Improved bounds for sampling colorings. J. Math. Physics 41, 1555–1569 (2000)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Brendan Lucier
    • 1
  • Michael Molloy
    • 1
  • Yuval Peres
    • 2
  1. 1.Dept of Computer ScienceUniversity of TorontoCanada
  2. 2.Microsoft ResearchUSA

Personalised recommendations