English

The Mixing Time of Glauber Dynamics for Colouring Regular Trees

Computational Complexity 2008-06-06 v1 Discrete Mathematics

Abstract

We consider Metropolis Glauber dynamics for sampling proper qq-colourings of the nn-vertex complete bb-ary tree when 3qb/2ln(b)3\leq q\leq b/2\ln(b). We give both upper and lower bounds on the mixing time. For fixed qq and bb, our upper bound is nO(b/logb)n^{O(b/\log b)} and our lower bound is nΩ(b/qlog(b))n^{\Omega(b/q \log(b))}, where the constants implicit in the O()O() and Ω()\Omega() notation do not depend upon nn, qq or bb.

Cite

@article{arxiv.0806.0921,
  title  = {The Mixing Time of Glauber Dynamics for Colouring Regular Trees},
  author = {Leslie Ann Goldberg and Mark Jerrum and Marek Karpinski},
  journal= {arXiv preprint arXiv:0806.0921},
  year   = {2008}
}
R2 v1 2026-06-21T10:47:43.855Z