Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees

preprint2010arXivOpen access

Abstract

We study the effect of boundary conditions on the relaxation time of the Glauber dynamics for the hard-core model on the tree. The hard-core model is defined on the set of independent sets weighted by a parameter λλ, called the activity. The Glauber dynamics is the Markov chain that updates a randomly chosen vertex in each step. On the infinite tree with branching factor bb, the hard-core model can be equivalently defined as a broadcasting process with a parameter ωω which is the positive solution to λ=ω(1+ω)bλ=ω(1+ω)^b, and vertices are occupied with probability ω/(1+ω)ω/(1+ω) when their parent is unoccupied. This broadcasting process undergoes a phase transition between the so-called reconstruction and non-reconstruction regions at ωr≈ln⁡b/bω_r\approx \ln{b}/b. Reconstruction has been of considerable interest recently since it appears to be intimately connected to the efficiency of local algorithms on locally tree-like graphs, such as sparse random graphs. In this paper we show that the relaxation time of the Glauber dynamics on regular bb-ary trees ThT_h of height hh and nn vertices, undergoes a phase transition around the reconstruction threshold. In particular, we construct a boundary condition for which the relaxation time slows down at the reconstruction threshold. More precisely, for any ω≤ln⁡b/bω\le \ln{b}/b, for ThT_h with any boundary condition, the relaxation time is Ω(n)Ω(n) and O(n1+ob(1))O(n^{1+o_b(1)}). In contrast, above the reconstruction threshold we show that for every δ>0δ>0, for ω=(1+δ)ln⁡b/bω=(1+δ)\ln{b}/b, the relaxation time on ThT_h with any boundary condition is O(n1+δ+ob(1))O(n^{1+δ+ o_b(1)}), and we construct a boundary condition where the relaxation time is Ω(n1+δ/2−ob(1))Ω(n^{1+δ/2 - o_b(1)}).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.