The Sweeny algorithm for the -state random-cluster model in two dimensions is shown to exhibit a rich mixture of critical dynamical scaling behaviors. As 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 , the integrated autocorrelation time diverges as , with , leading to the non-ergodicity of the Sweeny method for . Such -dependent critical slowing-down, attributed to the peculiar form of the critical bond weight , 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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本