The Glauber Dynamics for Colourings of Bounded Degree Trees

@inproceedings{Lucier2009TheGD,
  title={The Glauber Dynamics for Colourings of Bounded Degree Trees},
  author={Brendan Lucier and Michael Molloy and Yuval Peres},
  booktitle={APPROX-RANDOM},
  year={2009}
}
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 the complete tree is n log . For k ≥ 4 we show that the mixing time on every tree is at most n log . Our proof uses a weighted canonical paths analysis and a variation of the block dynamics in which we exploit the differing relaxation times of blocks. Dept of Computer Science, University of Toronto, blucier@cs.toronto.edu. Dept of Computer Science, University of… CONTINUE READING