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 -colourings of the -vertex complete -ary tree when . We give both upper and lower bounds on the mixing time. For fixed and , our upper bound is and our lower bound is , where the constants implicit in the and notation do not depend upon , or .
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}
}