English
Related papers

Related papers: Entropy decay in the Swendsen-Wang dynamics on ${\…

200 papers

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 consider spin systems with nearest-neighbor interactions on an $n$-vertex $d$-dimensional cube of the integer lattice graph $\mathbb{Z}^d$. We study the effects that exponential decay with distance of spin correlations, specifically the…

Discrete Mathematics · Computer Science 2017-08-07 Antonio Blanca , Pietro Caputo , 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

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 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 consider spin systems on general $n$-vertex graphs of unbounded degree and explore the effects of spectral independence on the rate of convergence to equilibrium of global Markov chains. Spectral independence is a novel way of…

Probability · Mathematics 2023-08-30 Antonio Blanca , Xusheng Zhang

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

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

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

We prove that the spectral gap of the Swendsen-Wang dynamics for the random-cluster model on arbitrary graphs with m edges is bounded above by 16 m log m times the spectral gap of the single-bond (or heat-bath) dynamics. This and the…

Probability · Mathematics 2012-02-29 Mario Ullrich

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

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 $q$-state ferromagnetic Potts model on the $n$-vertex complete graph known as the mean-field (Curie-Weiss) model. We analyze the Swendsen-Wang algorithm which is a Markov chain that utilizes the random cluster representation…

Discrete Mathematics · Computer Science 2017-11-27 Andreas Galanis , Daniel Stefankovic , Eric Vigoda

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

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

An important paradigm in the understanding of mixing times of Glauber dynamics for spin systems is the correspondence between spatial mixing properties of the models and bounds on the mixing time of the dynamics. This includes, in…

Probability · Mathematics 2023-10-05 Reza Gheissari , Alistair Sinclair

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

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

We introduce a framework for obtaining tight mixing times for Markov chains based on what we call restricted modified log-Sobolev inequalities. Modified log-Sobolev inequalities (MLSI) quantify the rate of relative entropy contraction for…

Data Structures and Algorithms · Computer Science 2021-11-08 Nima Anari , Vishesh Jain , Frederic Koehler , Huy Tuan Pham , Thuy-Duong Vuong
‹ Prev 1 2 3 10 Next ›