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 b, the hard-core model can be equivalently defined as a broadcasting process with a parameter ω which is the positive solution to λ=ω(1+ω)b, and vertices are occupied with probability ω/(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. Reconstruction ...
Consider random d-regular graphs, i.e., random graphs such that there are exactly d edges from each ...
Consider random d-regular graphs, i.e., random graphs such that there are exactly d edges from each ...
The even discrete torus is the graph TL,d on vertex set {0,..., L − 1}d (with L even) in which two v...
We study the effect of boundary conditions on the relaxation time (i.e., inverse spectral gap) of th...
We prove that the mixing time of the Glauber dynamics for random k-colorings of the complete tree wi...
We give the first comprehensive analysis of the effect of boundary conditions on the mixing time of...
Constraints satisfaction problem (CSP) is a family of computation problems that are generally hard t...
The mixing time of the Glauber dynamics for spin systems on trees is closely related to the reconstr...
Let T be a tree on n vertices and with maximum degree ∆. We show that for k ≥ ∆ + 1 the Glauber dyna...
We study continuous time Glauber dynamics for random configurations with local constraints (e.g. pro...
We study the mixing time of the Glauber dynamics for general spin systems on the regular tree, inclu...
We study the hard-core (gas) model defined on independent sets of an input graph where the independe...
We consider themodel of broadcasting on a tree, with binary state space, on theinfinite rooted tree ...
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determin...
Many local Markov chains based on Glauber dynamics are known to undergo a phase transition as a para...
Consider random d-regular graphs, i.e., random graphs such that there are exactly d edges from each ...
Consider random d-regular graphs, i.e., random graphs such that there are exactly d edges from each ...
The even discrete torus is the graph TL,d on vertex set {0,..., L − 1}d (with L even) in which two v...
We study the effect of boundary conditions on the relaxation time (i.e., inverse spectral gap) of th...
We prove that the mixing time of the Glauber dynamics for random k-colorings of the complete tree wi...
We give the first comprehensive analysis of the effect of boundary conditions on the mixing time of...
Constraints satisfaction problem (CSP) is a family of computation problems that are generally hard t...
The mixing time of the Glauber dynamics for spin systems on trees is closely related to the reconstr...
Let T be a tree on n vertices and with maximum degree ∆. We show that for k ≥ ∆ + 1 the Glauber dyna...
We study continuous time Glauber dynamics for random configurations with local constraints (e.g. pro...
We study the mixing time of the Glauber dynamics for general spin systems on the regular tree, inclu...
We study the hard-core (gas) model defined on independent sets of an input graph where the independe...
We consider themodel of broadcasting on a tree, with binary state space, on theinfinite rooted tree ...
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determin...
Many local Markov chains based on Glauber dynamics are known to undergo a phase transition as a para...
Consider random d-regular graphs, i.e., random graphs such that there are exactly d edges from each ...
Consider random d-regular graphs, i.e., random graphs such that there are exactly d edges from each ...
The even discrete torus is the graph TL,d on vertex set {0,..., L − 1}d (with L even) in which two v...