pith. machine review for the scientific record. sign in

arxiv: 0806.0921 · v1 · submitted 2008-06-05 · 💻 cs.CC · cs.DM

Recognition: unknown

The Mixing Time of Glauber Dynamics for Colouring Regular Trees

Authors on Pith no claims yet
classification 💻 cs.CC cs.DM
keywords bounddynamicsglauberlowermixingomegatimeupper
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.