English
Related papers

Related papers: Swendsen-Wang Dynamics for General Graphs in the T…

200 papers

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

We study Glauber dynamics for the Ising model on the complete graph on $n$ vertices, known as the Curie-Weiss Model. It is well known that at high temperature ($\beta < 1$) the mixing time is $\Theta(n\log n)$, whereas at low temperature…

Probability · Mathematics 2015-05-13 Jian Ding , Eyal Lubetzky , Yuval Peres

Consider Glauber dynamics for the Ising model on a graph of $n$ vertices. Hayes and Sinclair showed that the mixing time for this dynamics is at least $n\log n/f(\Delta)$, where $\Delta$ is the maximum degree and $f(\Delta) = \Theta(\Delta…

Probability · Mathematics 2013-09-26 Jian Ding , Yuval Peres

For general antiferromagnetic 2-spin systems, including the hardcore model and the antiferromagnetic Ising model, there is an $\mathsf{FPTAS}$ for the partition function on graphs of maximum degree $\Delta$ when the infinite regular tree…

Data Structures and Algorithms · Computer Science 2021-07-20 Zongchen Chen , Kuikui Liu , Eric Vigoda

We prove that the spectral gap of the Swendsen-Wang dynamics for the random-cluster model is larger than the spectral gap of a single-bond dynamics, that updates only a single edge per step. For this we give a representation of the…

Probability · Mathematics 2014-01-21 Mario Ullrich

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…

Probability · Mathematics 2008-01-14 Elchanan Mossel , Allan Sly

We study the fixed-magnetization ferromagnetic Ising model on random $d$-regular graphs for $d\ge 3$ and inverse temperature below the tree reconstruction threshold. Our main result is that for each magnetization $\eta$, the free energy…

Probability · Mathematics 2025-11-21 Reza Gheissari , Will Perkins , Corrine Yap

Sznajd-Weron in [Phys. Rev. E {\bf 82}, 031120 (2010)] suggested that the one-dimensional Ising model subject to the zero temperature synchronous Glauber dynamics exhibits a discontinuous phase transition. We show here instead that the…

Statistical Mechanics · Physics 2011-07-14 Il Gu Yi , Beom Jun Kim

We study the performance of Markov chains for the $q$-state ferromagnetic Potts model on random regular graphs. It is conjectured that their performance is dictated by metastability phenomena, i.e., the presence of "phases" (clusters) in…

We give a new rapid mixing result for a natural random walk on the independent sets of a graph $G$. We show that when $G$ has bounded treewidth, this random walk -- known as the Glauber dynamics for the hardcore model -- mixes rapidly for…

Data Structures and Algorithms · Computer Science 2023-10-03 David Eppstein , Daniel Frishberg

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

We study the random-cluster model on trees and treelike graphs at low temperatures. This is a model of dependent percolation parametrized by an edge probability $p\in (0,1)$ and a clustering weight $q\in [1,\infty)$, generalizing…

Probability · Mathematics 2026-04-23 Antonio Blanca , Reza Gheissari , Heehyun Park , Xusheng Zhang

Exponential random graphs are used extensively in the sociology literature. This model seeks to incorporate in random graphs the notion of reciprocity, that is, the larger than expected number of triangles and other small subgraphs.…

Probability · Mathematics 2008-12-15 Shankar Bhamidi , Guy Bresler , Allan Sly

We address the convergence rate of Markov chains for randomly generating an edge coloring of a given tree. Our focus is on the Glauber dynamics which updates the color at a randomly chosen edge in each step. For a tree $T$ with $n$ vertices…

Discrete Mathematics · Computer Science 2024-07-08 Charlie Carlson , Xiaoyu Chen , Weiming Feng , Eric Vigoda

We prove that at any inverse temperature $\beta$ and on any transitive amenable graph, the automorphism-invariant Gibbs states of the ferromagnetic Ising model are convex combinations of the plus and minus states. This is obtained for a…

Probability · Mathematics 2017-10-23 Aran Raoufi

We prove an optimal $\Omega(n^{-1})$ lower bound on the spectral gap of Glauber dynamics for anti-ferromagnetic two-spin systems with $n$ vertices in the tree uniqueness regime. This spectral gap holds for all, including unbounded, maximum…

Data Structures and Algorithms · Computer Science 2021-11-22 Xiaoyu Chen , Weiming Feng , Yitong Yin , Xinyuan Zhang

Spin-glasses are Gibbs distributions that have been studied in CS for many decades. Recently, they have gained renewed attention as they emerge naturally in learning, inference, optimisation etc. We consider the Edwards-Anderson (EA)…

Discrete Mathematics · Computer Science 2024-03-15 Charilaos Efthymiou , Kostas Zampetakis

We investigate the ferromagnetic Ising model on the Erd\H{o}s-R\'enyi random graph $\mathbb{G}(n,m)$ with bounded average degree $d=2m/n$. Specifically, we determine the limiting distribution of $\log Z_{\mathbb{G}(n,m)}(\beta,B)$, where…

Combinatorics · Mathematics 2026-01-21 Amin Coja-Oghlan , Dominik Kaaser , Maurice Rolvien , Pavel Zakharov , Kostas Zampetakis

In this paper, we consider the Ising model on random $d$-regular graphs (with $d\ge3$) and Erd\"os-R\'enyi graphs $G(n,d/n)$ (with $d>1$) at the critical temperature. We prove that the \textit{magnetization}, i.e.\ the sum of the spins of a…

Probability · Mathematics 2026-03-31 Kyprianos-Iason Prodromidis , Allan Sly

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