Random-cluster dynamics in Z 2

The random-cluster model has been widely studied as a unifying framework for random graphs, spin systems and electrical networks, but its dynamics have so far largely resisted analysis. In this paper we analyze the Glauber dynamics of the random-cluster model in the canonical case where the underlying graph is an n × n box in the Cartesian lattice Z2. Our main result is a O(n2 log n) upper bound for the mixing time at all values of the model parameter p except the critical point p = pc(q), and for all values of the second model parameter q ≥ 1. We also provide a matching lower bound proving that our result is tight. Our analysis takes as its starting point the recent breakthrough by Beffara and Duminil-Copin on the location of the random-cluster phase transition in Z2. It is reminiscent of similar results for spin systems such as the Ising and Potts models, but requires the reworking of several standard tools in the context of the random-cluster model, which is not a spin system in the usual sense.

[1]  Alistair Sinclair,et al.  Dynamics for the Mean-field Random-cluster Model , 2014, APPROX-RANDOM.

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

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

[4]  Lahoussine Laanait,et al.  Interfaces in the Potts model I: Pirogov-Sinai theory of the Fortuin-Kasteleyn representation , 1991 .

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

[6]  J. Berg,et al.  A uniqueness condition for Gibbs measures, with application to the 2-dimensional Ising antiferromagnet , 1993 .

[7]  Thomas P. Hayes,et al.  A general lower bound for mixing of single-site dynamics on graphs , 2005 .

[8]  Qi Ge,et al.  A Graph Polynomial for Independent Sets of Bipartite Graphs , 2012, Comb. Probab. Comput..

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

[10]  Mario Ullrich.  Rapid mixing of Swendsen–Wang dynamics in two dimensions , 2012, 1212.4908.

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

[12]  Asaf Nachmias,et al.  A power law of order 1/4 for critical mean-field Swendsen-Wang dynamics , 2011 .

[13]  Alan M. Frieze,et al.  Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[14]  H. Duminil-Copin,et al.  Continuity of the Phase Transition for Planar Random-Cluster and Potts Models with 1≤q≤4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} , 2016, Communications in Mathematical Physics.

[15]  M. Dyer,et al.  Mixing in time and space for lattice spin systems: A combinatorial view , 2002, International Workshop Randomization and Approximation Techniques in Computer Science.

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

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

[18]  H. Duminil-Copin,et al.  The self-dual point of the two-dimensional random-cluster model is critical for q ≥ 1 , 2010, 1006.5073.

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

[20]  V. Strassen.  The Existence of Probability Measures with Given Marginals , 1965 .

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

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

[23]  C. Fortuin.  On the random-cluster model: III. The simple random-cluster model , 1972 .

[24]  Elchanan Mossel,et al.  Exact thresholds for Ising–Gibbs samplers on general graphs , 2009, The Annals of Probability.

[25]  Eric Vigoda,et al.  Swendsen‐Wang algorithm on the mean‐field Potts model , 2015, APPROX-RANDOM.

[26]  K. Alexander.  Mixing properties and exponential decay for lattice systems in finite volumes , 2004 .

[27]  J. Propp,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996 .

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

[29]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .