Mathematics – Probability
Scientific paper
2009-08-19
Mathematics
Probability
Scientific paper
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+o_b(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\geq 1$ we prove the mixing time is $O(n^{1+o_b(1)}\ln^2{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 + o_b(1)}\ln^2{n})$ and $\Omega(n^{1/C-o_b(1)})$. The critical point C=1 is interesting since it coincides (at least up to first order) to 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.
Tetali Prasad
Vera Juan C.
Vigoda Eric
Yang Linji
No associations
LandOfFree
Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-216013