Comparison of Swendsen‐Wang and heat‐bath dynamics
Author:
- 11 May 2012
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 42 (4) , 520-535
Abstract
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 for the two‐dimensional Potts model at all temperatures above the critical one, as well as rapid mixing at the critical temperature for the Ising model. After this we introduce a modified version of the Swendsen‐Wang algorithm for planar graphs and prove rapid mixing for the two‐dimensional Potts models at all non‐critical temperatures. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 42, 520–535, 2013Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition pointProbability Theory and Related Fields, 2010
- Glauber dynamics on trees and hyperbolic graphsProbability Theory and Related Fields, 2004
- A bounding chain for Swendsen‐WangRandom Structures & Algorithms, 2002
- Mixing properties of the Swendsen–Wang process on the complete graph and narrow gridsJournal of Mathematical Physics, 2000
- On weak mixing in lattice modelsProbability Theory and Related Fields, 1998
- For 2-D lattice spin systems weak mixing implies strong mixingCommunications in Mathematical Physics, 1994
- Dynamical analysis of low-temperature monte carlo cluster algorithmsJournal of Statistical Physics, 1992
- Rigorous lower bound on the dynamic critical exponents of the Swendsen-Wang algorithmPhysical Review Letters, 1989
- Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithmPhysical Review D, 1988
- On the random-cluster modelPhysica, 1972