Related papers: Rapid Mixing via Coupling Independence for Spin Sy…

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…

We show that Glauber dynamics for $ p$-spin glass mixes exponentially slowly at inverse temperatures larger than a constant times $ \ln (p)/p $ for large enough $ p $. This is done by analyzing the energy landscape using Gaussian…

Motivated by the community detection problem in Bayesian inference, as well as the recent explosion of interest in spin glasses from statistical physics, we study the classical Glauber dynamics for sampling from Ising models with sparse…

We analyze the density and size dependence of the relaxation time $\tau$ for kinetically constrained spin systems. These have been proposed as models for strong or fragile glasses and for systems undergoing jamming transitions. For the one…

We present novel results for fast mixing of Glauber dynamics using the newly introduced and powerful Spectral Independence method from [Anari, Liu, Oveis-Gharan: FOCS 2020]. In our results, the parameters of the Gibbs distribution are…

The broad motivation of this work is a rigorous understanding of reversible, local Markov dynamics of interfaces, and in particular their speed of convergence to equilibrium, measured via the mixing time $T_{mix}$. In the…

In this note, we prove that on any graph of maximal degree $d$ the mixing time of the Glauber Dynamics for the Ising Model at $\beta_c=\tanh^{-1}(\frac1{d-1})$, the uniqueness threshold on the infinite $d$-regular tree, is at most…

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…

We consider the problem of sampling from the ferromagnetic Potts and random-cluster models on a general family of random graphs via the Glauber dynamics for the random-cluster model. The random-cluster model is parametrized by an edge…

Introduced in 1963, Glauber dynamics is one of the most practiced and extensively studied methods for sampling the Ising model on lattices. It is well known that at high temperatures, the time it takes this chain to mix in $L^1$ on a system…

We consider random lattice triangulations of $n\times k$ rectangular regions with weight $\lambda^{|\sigma|}$ where $\lambda>0$ is a parameter and $|\sigma|$ denotes the total edge length of the triangulation. When $\lambda\in(0,1)$ and $k$…

We theoretically investigate the spin-mixing dynamics of a spinor BEC subject to a time-dependent confining potential. Our study provides a theory framework for the experimental results reported in Phys. Rev. A 109, 043309 (2024). We…

We consider the Ising, and more generally, $q$-state Potts Glauber dynamics on random $d$-regular graphs on $n$ vertices at low temperatures $\beta \gtrsim \frac{\log d}{d}$. The mixing time is exponential in $n$ due to a bottleneck between…

Let $G = (V,E)$ be a graph on $n$ vertices and let $m^*(G)$ denote the size of a maximum matching in $G$. We show that for any $\delta > 0$ and for any $1 \leq k \leq (1-\delta)m^*(G)$, the down-up walk on matchings of size $k$ in $G$ mixes…

The Ising model doesn't have a strictly defined dynamics, only a spectrum. There are different ways to equip it with a time dependence e.g. the Glauber or the Kawasaki dynamics, which are both stochastic, but it means there is a master…

We show that spin systems with bounded degrees and coupling independence admit fully polynomial time approximation schemes (FPTAS). We design a new recursive deterministic counting algorithm to achieve this. As applications, we give the…

We study the worst-case mixing time of the global Kawasaki dynamics for the fixed-magnetization Ising model on the class of graphs of maximum degree $\Delta$. Proving a conjecture of Carlson, Davies, Kolla, and Perkins, we show that below…

We study analytically and numerically the statics and the off-equilibrium dynamics of spin models over finitely connected random graphs. We identify a threshold value for the connectivity beyond which the loop structure of the graph becomes…

Glassy systems are characterized by an extremely sluggish dynamics without any simple sign of long range order. It is a debated question whether a correct description of such phenomenon requires the emergence of a large correlation length.…

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…