Sweeny dynamics for the random-cluster model with small $Q$

Abstract

The Sweeny algorithm for the $Q$-state random-cluster model in two dimensions is shown to exhibit a rich mixture of critical dynamical scaling behaviors. As $Q$ decreases, the so-called critical speeding-up for non-local quantities becomes more and more pronounced. However, for some quantity of specific local pattern -- e.g., the number of half faces on the square lattice, we observe that, as $Q\to 0$, the integrated autocorrelation time $\tau$ diverges as $Q^{-\zeta }$, with $\zeta \simeq 1/2$, leading to the non-ergodicity of the Sweeny method for $Q\to 0$. Such $Q$-dependent critical slowing-down, attributed to the peculiar form of the critical bond weight $v=\sqrt{Q}$, can be eliminated by a combination of the Sweeny and the Kawasaki algorithm. Moreover, by classifying the occupied bonds into bridge bonds and backbone bonds, and the empty bonds into internal-perimeter bonds and external-perimeter bonds, one can formulate an improved version of the Sweeny-Kawasaki method such that the autocorrelation time for any quantity is of order $O(1)$.

arXiv comment10 pages, 8 figures, accepted for publication in Physical Review E

References in corpus (11)

• Worm algorithms for classical statistical models
• The Number of Incipient Spanning Clusters in Two-Dimensional Percolation
• Spanning forests and the q-state Potts model in the limit q \to 0
• Ferromagnetic phase transition for the spanning-forest model (q \to 0 limit of the Potts model) in three or more dimensions
• Some geometric critical exponents for percolation and the random-cluster model
• Geometric structure of percolation clusters
• Short-range correlations in percolation at criticality
• Critical speeding-up in a local dynamics for the random-cluster model
• Efficient simulation of the random-cluster model
• Linking and Cutting Spanning Trees
• Bridges in the random-cluster model

Cited by in corpus (1)

• Universality of the complete-graph Potts model with $0<q\le 2$