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 0, the integrated autocorrelation time τ diverges as Q-ζ, with ζ 1/2, leading to the non-ergodicity of the Sweeny method for Q 0. Such Q-dependent critical slowing-down, attributed to the peculiar form of the critical bond weight v=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).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…