Phase transition for the mixing time of the Glauber dynamics for coloring regular trees

10Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.

Abstract

We prove that the mixing time of the Glauber dynamics for random k-colorings of the complete tree with branching factor b undergoes a phase transition at k = b(1 + ob(1))/ln b. Our main result shows nearly sharp bounds on the mixing time of the dynamics on the complete tree with n vertices for k = Cb/ln b colors with constant C. For C ≥ 1 we prove the mixing time is O(n1+ob(1) ln n). On the other side, for C <1 the mixing time experiences a slowing down; in particular, we prove it is O(n 1/C+ob(1) ln n) and Ω(n1/C-ob(1)). The critical point C = 1 is interesting since it coincides (at least up to first order) with the so-called reconstruction threshold which was recently established by Sly. The reconstruction threshold has been of considerable interest recently since it appears to have close connections to the efficiency of certain local algorithms, and this work was inspired by our attempt to understand these connections in this particular setting. © Institute of Mathematical Statistics, 2012.

Cite

CITATION STYLE

APA

Tetali, P., Vera, J. C., Vigoda, E., & Yang, L. (2012). Phase transition for the mixing time of the Glauber dynamics for coloring regular trees. Annals of Applied Probability, 22(6), 2210–2239. https://doi.org/10.1214/11-AAP833

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free