English
Related papers

Related papers: Rapid mixing of Swendsen-Wang and single-bond dyna…

200 papers

We prove comparison results for the Swendsen-Wang (SW) dynamics, the heat-bath (HB) dynamics for the Potts model and the single-bond (SB) dynamics for the random-cluster model on arbitrary graphs. In particular, we prove that rapid mixing…

Probability · Mathematics 2014-05-15 Mario Ullrich

We prove that the spectral gap of the Swendsen-Wang process for the Potts model on graphs with bounded degree is bounded from below by some constant times the spectral gap of any single-spin dynamics. This implies rapid mixing of the…

Probability · Mathematics 2013-05-23 Mario Ullrich

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

We study the Swendsen-Wang dynamics for the $q$-state Potts model on the lattice. Introduced as an alternative algorithm of the classical single-site Glauber dynamics, the Swendsen-Wang dynamics is a non-local Markov chain that recolors…

Probability · Mathematics 2019-04-03 Danny Nam , Allan Sly

We study two widely used algorithms for the Potts model on rectangular subsets of the hypercubic lattice Z^d - heat bath dynamics and the Swendsen-Wang algorithm - and prove that, under certain circumstances, the mixing in these algorithms…

Probability · Mathematics 2010-11-16 Christian Borgs , Jennifer T. Chayes , Prasad Tetali

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…

Data Structures and Algorithms · Computer Science 2016-05-03 Heng Guo , Mark Jerrum

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…

Discrete Mathematics · Computer Science 2018-06-13 Antonio Blanca , Zongchen Chen , Eric Vigoda

We study the mixing time of the Swendsen-Wang dynamics for the ferromagnetic Ising and Potts models on the integer lattice ${\mathbb Z}^d$. This dynamics is a widely used Markov chain that has largely resisted sharp analysis because it is…

Probability · Mathematics 2021-03-25 Antonio Blanca , Pietro Caputo , Daniel Parisi , Alistair Sinclair , Eric Vigoda

The Swendsen-Wang algorithm is a sophisticated, widely-used Markov chain for sampling from the Gibbs distribution for the ferromagnetic Ising and Potts models. This chain has proved difficult to analyze, due in part to the global nature of…

Probability · Mathematics 2021-05-11 Antonio Blanca , Zongchen Chen , Daniel Štefankovič , Eric Vigoda

We study the speed of convergence of the Swendsen-Wang (SW) dynamics for the $q$-state ferromagnetic Potts model on the $n$-vertex complete graph, known as the mean-field model. The SW dynamics was introduced as an attractive alternative to…

Probability · Mathematics 2025-10-14 Antonio Blanca , Zhezheng Song

We consider spin systems on the integer lattice graph $\mathbb{Z}^d$ with nearest-neighbor interactions. We develop a combinatorial framework for establishing that exponential decay with distance of spin correlations, specifically the…

Discrete Mathematics · Computer Science 2017-08-09 Antonio Blanca , Pietro Caputo , Alistair Sinclair , Eric Vigoda

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 Swendsen-Wang dynamics for disordered non ferromagnetic Ising models on cubic subsets of the hypercubic lattice Z^d and we show that for all small values of the temperature parameter T the dynamics has a slow relaxation to…

Probability · Mathematics 2007-05-23 Emilio De Santis

Swendsen-Wang dynamics for the Potts model was proposed in the late 1980's as an alternative to single-site heat-bath dynamics, in which global updates allow this MCMC sampler to switch between metastable states and ideally mix faster. Gore…

Probability · Mathematics 2017-05-03 Reza Gheissari , Eyal Lubetzky , Yuval Peres

The Swendsen-Wang dynamics is a Markov chain widely used by physicists to sample from the Boltzmann-Gibbs distribution of the Ising model. Cooper, Dyer, Frieze and Rue proved that on the complete graph K_n the mixing time of the chain is at…

Probability · Mathematics 2011-07-18 Yun Long , Asaf Nachmias , Weiyang Ning , Yuval Peres

This note introduces the double flip move for accelerating the Swendsen-Wang algorithm for Ising models with mixed boundary conditions below the critical temperature. The double flip move consists of a geometric flip of the spin lattice…

Numerical Analysis · Mathematics 2022-05-17 Lexing Ying

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…

Probability · Mathematics 2021-05-05 Antonio Blanca , Reza Gheissari

We prove two results on the mixing times of Markov chains for two-spin systems. First, we show that the Glauber dynamics mixes in polynomial time for the Gibbs distributions of antiferromagnetic two-spin systems at the critical threshold of…

Data Structures and Algorithms · Computer Science 2026-05-04 Xiaoyu Chen , Zhe Ju , Tianshun Miao , Yitong Yin , Xinyuan Zhang

For general spin systems, we prove that a contractive coupling for any local Markov chain implies optimal bounds on the mixing time and the modified log-Sobolev constant for a large class of Markov chains including the Glauber dynamics,…

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
‹ Prev 1 2 3 10 Next ›