Related papers: Glauber dynamics on nonamenable graphs: Boundary c…

We considerably improve upon the recent result of Martinelli and Toninelli on the mixing time of Glauber dynamics for the 2D Ising model in a box of side $L$ at low temperature and with random boundary conditions whose distribution $P$…

The hard-core model has as its configurations the independent sets of some graph instance $G$. The probability distribution on independent sets is controlled by a `fugacity' $\lambda>0$, with higher $\lambda$ leading to denser…

We present an improved coupling technique for analyzing the mixing time of Markov chains. Using our technique, we simplify and extend previous results for sampling colorings and independent sets. Our approach uses properties of the…

We consider Glauber dynamics for the Ising model on the complete graph on $n$ vertices, known as the Curie-Weiss model. It is well-known that the mixing-time in the high temperature regime ($\beta < 1$) has order $n\log n$, whereas the…

We study the Glauber dynamics for the Ising model on the complete graph, also known as the Curie-Weiss Model. For beta < 1, we prove that the dynamics exhibits a cut-off: the distance to stationarity drops from near 1 to near 0 in a window…

We study the mixing time of Glauber dynamics for Ising models in which the interaction matrix contains a single negative spectral outlier. This class includes the anti-ferromagnetic Curie-Weiss model, the anti-ferromagnetic Ising model on…

We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations of the solid-on-solid model of statistical physics. This model has been proposed, among other things, as an idealization of the behavior of…

In a series of recent works, Boyd, Diaconis, and their co-authors have introduced a semidefinite programming approach for computing the fastest mixing Markov chain on a graph of allowed transitions, given a target stationary distribution.…

We study Markov chains for randomly sampling $k$-colorings of a graph with maximum degree $\Delta$. Our main result is a polynomial upper bound on the mixing time of the single-site update chain known as the Glauber dynamics for planar…

We establish upper bounds for the spectral gap of the stochastic Ising model at low temperatures in an n-by-n box with boundary conditions which are not purely plus or minus; specifically, we assume the magnitude of the sum of the boundary…

It is well known that Glauber dynamics on spin systems typically suffer exponential slowdowns at low temperatures. This is due to the emergence of multiple metastable phases in the state space, separated by narrow bottlenecks that are hard…

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 prove that Ising models on the hypercube with general quadratic interactions satisfy a Poincar\'{e} inequality with respect to the natural Dirichlet form corresponding to Glauber dynamics, as soon as the operator norm of the interaction…

We prove that the the mixing time of the Glauber dynamics for sampling independent sets on $n$-vertex $k$-uniform hypergraphs is $O(n\log n)$ when the maximum degree $\Delta$ satisfies $\Delta \leq c 2^{k/2}$, improving on the previous…

We prove an optimal $O(n \log n)$ mixing time of the Glauber dynamics for the Ising models with edge activity $\beta \in \left(\frac{\Delta-2}{\Delta}, \frac{\Delta}{\Delta-2}\right)$. This mixing time bound holds even if the maximum degree…

We show that the mixing time of Glauber (single edge update) dynamics for the random cluster model at $q=2$ is bounded by a polynomial in the size of the underlying graph. As a consequence, the Swendsen-Wang algorithm for the ferromagnetic…

Consider random $d$-regular graphs, i.e., random graphs such that there are exactly $d$ edges from each vertex for some $d\ge 3$. We study both the configuration model version of this graph, which has occasional multi-edges and self-loops,…

We study the mixing time of Glauber dynamics on monotone systems. For monotone systems satisfying the entropic independence condition, we prove a new mixing time comparison result for Glauber dynamics. For concrete applications, we obtain…

Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sampling on the Erd\H{o}s-R\'enyi random graph G(n,d/n). While…

In this paper, the Glauber dynamics for the Ising model on the complete multipartite graph $K_{np_1,\dots,np_m}$ is investigated where $0<p_i<1$ is the proportion of the vertices in the $i$th component. We show that the dynamics exhibits…