Related papers: Systematic scanning Glauber dynamics for the mean-…

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…

This paper deals with the stochastic Ising model with a temperature shrinking to zero as time goes to infinity. A generalization of the Glauber dynamics is considered, on the basis of the existence of simultaneous flips of some spins. Such…

We establish rapid mixing of the random-cluster Glauber dynamics on random $\Delta$-regular graphs for all $q\ge 1$ and $p<p_u(q,\Delta)$, where the threshold $p_u(q,\Delta)$ corresponds to a uniqueness/non-uniqueness phase transition for…

Glauber dynamics of the Ising model on a random regular graph is known to mix fast below the tree uniqueness threshold and exponentially slowly above it. We show that Kawasaki dynamics of the canonical ferromagnetic Ising model on a random…

We study the ferromagnetic random field Ising model (RFIM) on a graph $G=(V,E)$ having maximal degree $\Delta$, where the external field at each vertex is an i.i.d. random variable. When the random field distribution is sufficiently…

The hardcore model is one of the most classic and widely studied examples of undirected graphical models. Given a graph $G$, the hardcore model describes a Gibbs distribution of $\lambda$-weighted independent sets of $G$. In the last two…

Consider the complete graph on $n$ vertices. To each vertex assign an Ising spin that can take the values $-1$ or $+1$. Each spin $i \in [n]=\{1,2,\dots, n\}$ interacts with a magnetic field $h \in [0,\infty)$, while each pair of spins $i,j…

In this work we show that for every $d < \infty$ and the Ising model defined on $G(n,d/n)$, there exists a $\beta_d > 0$, such that for all $\beta < \beta_d$ with probability going to 1 as $n \to \infty$, the mixing time of the dynamics on…

Glauber dynamics is a powerful tool to generate randomized, approximate solutions to combinatorially difficult problems. Applications include Markov Chain Monte Carlo (MCMC) simulation and distributed scheduling for wireless networks. In…

We consider the Glauber dynamics for the 2D Ising model in a box of side L, at inverse temperature $\beta$ and random boundary conditions $\tau$ whose distribution P either stochastically dominates the extremal plus phase (hence the…

In the heat-bath Glauber dynamics for the Ising model on the lattice, physicists believe that the spectral gap of the continuous-time chain exhibits the following behavior. For some critical inverse-temperature $\beta_c$, the inverse-gap is…

In this note we consider the Glauber dynamics for the mean-field Ising model, when all couplings are equal and the external field is uniform. It is proved that the relaxation time of the dynamics is monotonically decreasing in temperature.

We study Glauber dynamics for sampling from discrete distributions $\mu$ on the hypercube $\{\pm 1\}^n$. Recently, techniques based on spectral independence have successfully yielded optimal $O(n)$ relaxation times for a host of different…

We study the $q$-state ferromagnetic Potts model on the $n$-vertex complete graph known as the mean-field (Curie-Weiss) model. We analyze the Swendsen-Wang algorithm which is a Markov chain that utilizes the random cluster representation…

The mixing time of the Glauber dynamics for spin systems on trees is closely related to reconstruction problem. Martinelli, Sinclair and Weitz established this correspondence for a class of spin systems with soft constraints bounding the…

Let $T$ be a tree on $n$ vertices and with maximum degree $\Delta$. We show that for $k\geq \Delta+1$ the Glauber dynamics for $k$-edge-colourings of $T$ mixes in polynomial time in $n$. The bound on the number of colours is best possible…

A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of $k$-colorings of a graph $G$ on $n$ vertices with maximum degree $\Delta$ is rapidly mixing for $k \geq \Delta +2$. In FOCS 1999,…

The Swendsen-Wang dynamics is a popular algorithm for sampling from the Gibbs distribution for the ferromagnetic Ising model on a graph $G=(V,E)$. The dynamics is a "global" Markov chain which is conjectured to converge to equilibrium in…

We investigate the Langevin dynamics for Wigner matrices with a spherical spike, in the regime where the signal-to-noise ratio $\theta$ is large, but order one. For large, order-$1$, signal-to-noise, the (worst-case) mixing time undergoes a…

We consider the stochastic Ising model on sparse Erdos-Renyi graphs $G(n,d/n)$ with $d>1$ at the critical temperature $\beta_c=\tanh^{-1}(d^{-1})$ and prove that with high probability, the mixing time is at most polynomial in $n$. Our…