Rapid mixing of Swendsen-Wang and single-bond dynamics in two dimensions

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 corresponding lower bound imply that rapid mixing of these two dynamics is equivalent. Using the known lower bound on the spectral gap of the Swendsen-Wang dynamics for the two dimensional square lattice $Z_L^2$ of side length L at high temperatures and a result for the single-bond dynamics on dual graphs, we obtain rapid mixing of both dynamics on $\Z_L^2$ at all non-critical temperatures. In particular this implies, as far as we know, the first proof of rapid mixing of a classical Markov chain for the Ising model on $\Z_L^2$ at all temperatures.

[1]  Allan Sly,et al.  Critical Ising on the Square Lattice Mixes in Polynomial Time , 2010, 1001.1613.

[2]  Mario Ullrich,et al.  Swendsen-Wang Is Faster than Single-Bond Dynamics , 2012, SIAM J. Discret. Math..

[3]  V. Climenhaga.  Markov chains and mixing times , 2013 .

[4]  R. Parviainen.  Probability on graphs , 2002 .

[5]  F. Martinelli,et al.  Approach to equilibrium of Glauber dynamics in the one phase region , 1994 .

[6]  Alan M. Frieze,et al.  Mixing properties of the Swendsen-Wang process on classes of graphs , 1999, Random Struct. Algorithms.

[7]  C. Fortuin,et al.  On the random-cluster model: I. Introduction and relation to other models , 1972 .

[8]  Mark Jerrum,et al.  The Swendsen-Wang process does not always mix rapidly , 1997, STOC '97.

[9]  F. Martinelli,et al.  Approach to equilibrium of Glauber dynamics in the one phase region , 1994 .

[10]  Wang,et al.  Nonuniversal critical dynamics in Monte Carlo simulations. , 1987, Physical review letters.

[11]  F. Martinelli.  Lectures on Glauber dynamics for discrete spin models , 1999 .

[12]  Christian Borgs,et al.  Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point , 2010, ArXiv.

[13]  A. Sokal,et al.  Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. , 1988, Physical review. D, Particles and fields.

[14]  F. Martinelli.  Dynamical analysis of low-temperature monte carlo cluster algorithms , 1992 .

[15]  Yuval Peres,et al.  Mixing Time Power Laws at Criticality , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[16]  Mario Ullrich,et al.  Comparison of Swendsen‐Wang and heat‐bath dynamics , 2011, Random Struct. Algorithms.

[17]  K. Alexander.  On weak mixing in lattice models , 1998 .

[18]  F. Martinelli,et al.  For 2-D lattice spin systems weak mixing implies strong mixing , 1994 .

[19]  Martin Dyer,et al.  Mixing properties of the Swendsen–Wang process on the complete graph and narrow grids , 2000 .

[20]  F. Martinelli.  Rapid mixing of Swendsen-Wang dynamics in two dimensions , 2012 .

[21]  Geoffrey Grimmett.  The Random-Cluster Model , 2002, math/0205237.

[22]  Mark Huber,et al.  A bounding chain for Swendsen‐Wang , 2003, Random Struct. Algorithms.

[23]  P. Diaconis,et al.  COMPARISON THEOREMS FOR REVERSIBLE MARKOV CHAINS , 1993 .

[24]  E. Kreyszig.  Introductory Functional Analysis With Applications , 1978 .