12 research outputs found

    Swendsen-Wang Algorithm on the Mean-Field Potts Model

    Full text link
    We study the qq-state ferromagnetic Potts model on the nn-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 for the ferromagnetic Potts model to recolor large sets of vertices in one step and potentially overcomes obstacles that inhibit single-site Glauber dynamics. Long et al. studied the case q=2q=2, the Swendsen-Wang algorithm for the mean-field ferromagnetic Ising model, and showed that the mixing time satisfies: (i) Θ(1)\Theta(1) for β<βc\beta<\beta_c, (ii) Θ(n1/4)\Theta(n^{1/4}) for β=βc\beta=\beta_c, (iii) Θ(logn)\Theta(\log n) for β>βc\beta>\beta_c, where βc\beta_c is the critical temperature for the ordered/disordered phase transition. In contrast, for q3q\geq 3 there are two critical temperatures 0<βu<βrc0<\beta_u<\beta_{rc} that are relevant. We prove that the mixing time of the Swendsen-Wang algorithm for the ferromagnetic Potts model on the nn-vertex complete graph satisfies: (i) Θ(1)\Theta(1) for β<βu\beta<\beta_u, (ii) Θ(n1/3)\Theta(n^{1/3}) for β=βu\beta=\beta_u, (iii) exp(nΩ(1))\exp(n^{\Omega(1)}) for βu<β<βrc\beta_u<\beta<\beta_{rc}, and (iv) Θ(logn)\Theta(\log{n}) for ββrc\beta\geq\beta_{rc}. These results complement refined results of Cuff et al. on the mixing time of the Glauber dynamics for the ferromagnetic Potts model.Comment: To appear in Random Structures & Algorithm

    Swendsen-Wang Algorithm on the Mean-Field Potts Model

    Get PDF
    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 for the ferromagnetic Potts model to recolor large sets of vertices in one step and potentially overcomes obstacles that inhibit single-site Glauber dynamics. The case q=2 (the Swendsen-Wang algorithm for the ferromagnetic Ising model) undergoes a slow-down at the uniqueness/non-uniqueness critical temperature for the infinite Delta-regular tree (Long et al., 2014) but yet still has polynomial mixing time at all (inverse) temperatures beta>0 (Cooper et al., 2000). In contrast for q>=3 there are two critical temperatures 0=beta_rc. These results complement refined results of Cuff et al. (2012) on the mixing time of the Glauber dynamics for the ferromagnetic Potts model. The most interesting aspect of our analysis is at the critical temperature beta=beta_u, which requires a delicate choice of a potential function to balance the conflating factors for the slow drift away from a fixed point (which is repulsive but not Jacobian repulsive): close to the fixed point the variance from the percolation step dominates and sufficiently far from the fixed point the dynamics of the size of the dominant color class takes over

    Random-Cluster Dynamics in Z2\mathbb{Z}^2

    Full text link
    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×nn \times n box in the Cartesian lattice Z2\mathbb{Z}^2. Our main result is a O(n2logn)O(n^2\log n) upper bound for the mixing time at all values of the model parameter pp except the critical point p=pc(q)p=p_c(q), and for all values of the second model parameter q1q\ge 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\mathbb{Z}^2. 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

    Tunneling behavior of Ising and Potts models in the low-temperature regime

    Get PDF
    We consider the ferromagnetic qq-state Potts model with zero external field in a finite volume and assume that the stochastic evolution of this system is described by a Glauber-type dynamics parametrized by the inverse temperature β\beta. Our analysis concerns the low-temperature regime β\beta \to \infty, in which this multi-spin system has qq stable equilibria, corresponding to the configurations where all spins are equal. Focusing on grid graphs with various boundary conditions, we study the tunneling phenomena of the qq-state Potts model. More specifically, we describe the asymptotic behavior of the first hitting times between stable equilibria as β\beta \to \infty in probability, in expectation, and in distribution and obtain tight bounds on the mixing time as side-result. In the special case q=2q=2, our results characterize the tunneling behavior of the Ising model on grid graphs.Comment: 13 figure

    Low-temperature Ising dynamics with random initializations

    Full text link
    It is well known that Glauber dynamics on spin systems typically suffer exponential slowdowns at low temperatures. This is due to the emergence of multiple metastable phases in the state space, separated by narrow bottlenecks that are hard for the dynamics to cross. It is a folklore belief that if the dynamics is initialized from an appropriate random mixture of ground states, one for each phase, then convergence to the Gibbs distribution should be polynomially fast. However, such phenomena have largely evaded rigorous analysis, as most tools in the analysis of Markov chain mixing times are tailored to worst-case initializations. In this paper, we establish this conjectured behavior for the classical case of the Ising model on an NN-vertex torus in Zd\mathbb Z^d. Namely, we show that the mixing time for the Glauber dynamics, initialized in a 12\frac 12-12\frac 12 mixture of the all-plus and all-minus configurations, is O(NlogN)O(N\log N) in all dimensions, at all temperatures below the critical one. We also give a matching lower bound, showing that this is optimal. A key innovation in our analysis is the introduction of the notion of "weak spatial mixing within a phase", an adaptation of the classical concept of weak spatial mixing. We show both that this new notion is strong enough to imply rapid mixing of the Glauber dynamics from the above random initialization, and that it holds for the Ising model at all low temperatures and in all dimensions. As byproducts of our analysis, we also prove rapid mixing of the Glauber dynamics restricted to the plus phase, and the Glauber dynamics on a box in Zd\mathbb Z^d with plus boundary conditions, when initialized from the all-plus configuration.Comment: 32 pages, 3 figure
    corecore