English
Related papers

Related papers: Random-cluster dynamics in $\mathbb Z^2$: rapid mi…

200 papers

This article studies the planar Potts model and its random-cluster representation. We show that the phase transition of the nearest-neighbor ferromagnetic $q$-state Potts model on $\mathbb Z^2$ is continuous for $q\in\{2,3,4\}$, in the…

Probability · Mathematics 2016-11-03 Hugo Duminil-Copin , Vladas Sidoravicius , Vincent Tassion

We develop a new framework to prove the mixing or relaxation time for the Glauber dynamics on spin systems with unbounded degree. It works for general spin systems including both $2$-spin and multi-spin systems. As applications for this…

Data Structures and Algorithms · Computer Science 2024-07-08 Xiaoyu Chen , Weiming Feng

In this work we prove sufficient conditions for the Glauber dynamics corresponding to a sequence of (non-product) measures on finite product spaces to be rapidly mixing, i.e. that the mixing time with respect to the total variation distance…

Probability · Mathematics 2019-02-27 Arthur Sinulis

Over the past decades, a fascinating computational phase transition has been identified in sampling from Gibbs distributions. Though, the computational complexity at the critical point remains poorly understood, as previous algorithmic and…

Data Structures and Algorithms · Computer Science 2026-01-08 Xiaoyu Chen , Zongchen Chen , Yitong Yin , Xinyuan Zhang

The class of random-cluster models is a unification of a variety of stochastic processes of significance for probability and statistical physics, including percolation, Ising, and Potts models; in addition, their study has impact on the…

Probability · Mathematics 2007-05-23 Geoffrey Grimmett

We study conditioned random-cluster measures with edge-parameter p and cluster-weighting factor q satisfying q \ge 1. The conditioning corresponds to mixed boundary conditions for a spin model. Interfaces may be defined in the sense of…

Probability · Mathematics 2007-05-23 Guy Gielis , Geoffrey Grimmett

Sampling from the $q$-state ferromagnetic Potts model is a fundamental question in statistical physics, probability theory, and theoretical computer science. On general graphs, this problem may be computationally hard, and this hardness…

Probability · Mathematics 2024-12-24 Antonio Blanca , Reza Gheissari

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…

Mathematical Physics · Physics 2010-08-03 Fabio Martinelli , Alistair Sinclair

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$…

Probability · Mathematics 2015-03-17 Eyal Lubetzky , Fabio Martinelli , Allan Sly , Fabio Lucio Toninelli

The Glauber dynamics for the classical $2$-spin Curie-Weiss model on $N$ nodes with inverse temperature $\beta$ and zero external field is known to mix in time $\Theta(N\log N)$ for $\beta < \frac{1}{2}$, in time $\Theta(N^{3/2})$ at $\beta…

Probability · Mathematics 2025-02-21 Ramkrishna Jyoti Samanta , Somabha Mukherjee , Jiang Zhang

We study the single-site Glauber dynamics for the fugacity $\lambda$, Hard-core model on the random graph $G(n, d/n)$. We show that for the typical instances of the random graph $G(n,d/n)$ and for fugacity $\lambda <…

Discrete Mathematics · Computer Science 2023-02-14 Charilaos Efthymiou , Weiming Feng

We study the sampling problem for the ferromagnetic Ising model with consistent external fields, and in particular, Swendsen-Wang dynamics on this model. We introduce a new grand model unifying two closely related models: the subgraph world…

Data Structures and Algorithms · Computer Science 2022-07-19 Weiming Feng , Heng Guo , Jiaheng Wang

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…

Probability · Mathematics 2026-05-05 Yi Han

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…

Probability · Mathematics 2024-08-07 Kuikui Liu , Sidhanth Mohanty , Amit Rajaraman , David X. Wu

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…

Probability · Mathematics 2024-12-24 Reza Gheissari , Alistair Sinclair

Exponential random graph models have become increasingly important in the study of modern networks ranging from social networks, economic networks, to biological networks. They seek to capture a wide variety of common network tendencies…

Probability · Mathematics 2019-06-07 Ryan DeMuse , Terry Easlick , Mei Yin

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…

Probability · Mathematics 2026-01-14 Mark Jerrum

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…

Data Structures and Algorithms · Computer Science 2026-01-08 Zongchen Chen , Tianhui Jiang

We consider the anti-ferromagnetic Potts model on the the integer lattice Z^2. The model has two parameters, q, the number of spins, and \lambda=\exp(-\beta), where \beta is ``inverse temperature''. It is known that the model has strong…

Mathematical Physics · Physics 2007-05-23 Leslie Ann Goldberg , Markus Jalsenius , Russell Martin , Mike Paterson

We prove that any Markov chain that performs local, reversible updates on randomly chosen vertices of a bounded-degree graph necessarily has mixing time at least $\Omega(n\log n)$, where $n$ is the number of vertices. Our bound applies to…

Probability · Mathematics 2009-09-29 Thomas P. Hayes , Alistair Sinclair