arXiv:0907.1711 · Physical Review E

Single-cluster dynamics for the random-cluster model

Youjin Deng, Xiaofeng Qian, Henk W. J. Blöte

Published Sep 30, 2009• 5 citations

Abstract

We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the q-state Potts model to noninteger values q>1. Its results for static quantities are in a satisfactory agreement with those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which involves a full-cluster decomposition of random-cluster configurations. We explore the critical dynamics of this algorithm for several two-dimensional Potts and random-cluster models. For integer q, the single-cluster algorithm can be reduced to the Wolff algorithm, for which case we find that the autocorrelation functions decay almost purely exponentially, with dynamic exponents z(exp)=0.07 (1), 0.521 (7), and 1.007 (9) for q=2, 3, and 4, respectively. For noninteger q, the dynamical behavior of the single-cluster algorithm appears to be very dissimilar to that of the SWCM algorithm. For large critical systems, the autocorrelation function displays a range of power-law behavior as a function of time. The dynamic exponents are relatively large. We provide an explanation for this peculiar dynamic behavior.

DOI: 10.1103/physreve.80.036707

Related papers

Dynamical critical properties of the random-bond three-state Potts model

Anonymous, Ulvi Kanbur, Mohammad Sadra Najafi +2 more

We study the dynamic critical behavior of the two-dimensional random-bond three-state Potts model using large-scale Monte Carlo simulations with the Wolff and Swendsen-Wang cluster algorithms. At the disorder-dependent critical temperature, we compute integrated and exponential autocorrelation times and extract the dynamic critical exponent z via finite-size scaling. Critical slowing down is significantly weakened by bond randomness, with the dynamic exponent decreasing from z≈0.54 in the pure system to z≈0.24 at strong disorder. From the finite-size scaling of the Wolff cluster size, we obtain γ/ν≈1.73, where γ and ν are the susceptibility and correlation-length exponents, respectively, consistent with the universality class of the two-dimensional three-state Potts model. These results indicate that bond randomness strongly affects the critical dynamics but leaves the underlying static universality class unchanged. Furthermore, both static and dynamic observables, including the specific heat and the autocorrelation times, show a lack of self-averaging.

arXiv:2610.01176Physical review. EAug 13, 20260 citations

Critical Behavior of the Chayes–Machta–Swendsen–Wang Dynamics

Youjin Deng, Timothy M. Garoni, Jonathan L. Machta +3 more

We study the dynamic critical behavior of the Chayes-Machta dynamics for the Fortuin-Kasteleyn random-cluster model, which generalizes the Swendsen-Wang dynamics for the q-state Potts model to noninteger q, in two and three spatial dimensions, by Monte Carlo simulation. We show that the Li-Sokal bound z >or= alpha/nu is close to but probably not sharp in d = 2 and is far from sharp in d = 3, for all q. The conjecture z >or= beta/nu is false (for some values of q) in both d = 2 and d = 3.

arXiv:0705.2751Physical Review LettersJul 31, 200724 citations

Critical dynamics of cluster algorithms in the random-bond Ising model

Ulvi Kanbur, Zeynep Demir Vatansever

In the present work, we present an extensive Monte Carlo simulation study on the dynamical properties of the two-dimensional random-bond Ising model. The correlation time τ of the Swendsen-Wang and Wolff cluster algorithms is calculated at the critical point. The dynamic critical exponent z of both algorithms is also measured by using the numerical data for several lattice sizes up to L=512. It is found for both algorithms that the autocorrelation time decreases considerably and the critical slowing-down effect reduces upon the introduction of bond disorder. Additionally, simulations with the Metropolis algorithm are performed, and the critical slowing-down effect is observed to be more pronounced in the presence of disorder, confirming the previous findings in the literature. Moreover, the existence of the non-self-averaging property of the model is demonstrated by calculating the scaled form of the standard deviation of autocorrelation times. Finally, the critical exponent ratio of the magnetic susceptibility is estimated by using the average cluster size of the Wolff algorithm.

Physical review. EFeb 28, 20242 citations

Critical Speeding-Up in the Local Dynamics of the Random-Cluster Model

Youjin Deng, Timothy M. Garoni, Alan D. Sokal

We study the dynamic critical behavior of the local bond-update (Sweeny) dynamics for the Fortuin-Kasteleyn random-cluster model in dimensions d=2, 3 by Monte Carlo simulation. We show that, for a suitable range of q values, the global observable S2 exhibits "critical speeding-up": it decorrelates well on time scales much less than one sweep. In some cases the dynamic critical exponent for the integrated autocorrelation time is negative. We also show that the dynamic critical exponent zexp is very close (possibly equal) to the rigorous lower bound alpha/nu and quite possibly smaller than the corresponding exponent for the Chayes-Machta-Swendsen-Wang cluster dynamics.

arXiv:cond-mat/0701113Physical Review LettersJun 7, 200723 citations

Comparison of cluster algorithms for the bond-diluted Ising model

Arnold H. Kole, G. T. Barkema, Lars Fritz

Monte Carlo cluster algorithms are popular for their efficiency in studying the Ising model near its critical temperature. We might expect that this efficiency extends to the bond-diluted Ising model. We show, however, that this is not always the case by comparing how the correlation times τ_{w} and τ_{sw} of the Wolff and Swendsen-Wang cluster algorithms scale as a function of the system size L when applied to the two-dimensional bond-diluted Ising model. We demonstrate that the Wolff algorithm suffers from a much longer correlation time than in the pure Ising model, caused by isolated (groups of) spins which are infrequently visited by the algorithm. With a simple argument we prove that these cause the correlation time τ_{w} to be bounded from below by L^{z_{w}} with a dynamical exponent z_{w}=γ/ν≈1.75 for a bond concentration p<1. Furthermore, we numerically show that this lower bound is actually taken for several values of p in the range 0.5<p<1. Moreover, we show that the Swendsen-Wang algorithm does not suffer from the same problem. Consequently, it has a much shorter correlation time, shorter than in the pure Ising model even. Numerically at p=0.6, we find that its dynamical exponent is z_{sw}=0.09(4).

arXiv:2107.08534Physical review. EJan 31, 20224 citations

Numerical simulation study of the dynamical behavior of the Niedermayer algorithm

Daniel Girardi, N. S. Branco

We calculate the dynamic critical exponent for the Niedermayer algorithm applied to the two-dimensional Ising and XY models, for various values of the free parameter E 0 . For E 0 = − 1 we regain the Metropolis algorithm and for E 0 = 1 we regain the Wolff algorithm. For − 1 < E 0 < 1, we show that the mean size of the clusters of (possibly) turned spins initially grows with the linear size of the lattice, L , but eventually saturates at a given lattice size , which depends on E 0 . For , the Niedermayer algorithm is equivalent to the Metropolis one, i.e., they have the same dynamic exponent. For E 0 > 1, the autocorrelation time is always greater than for E 0 = 1 (Wolff) and, more important, it also grows faster than a power of L . Therefore, we show that the best choice of cluster algorithm is the Wolff one, when comparing against the Niedermayer generalization. We also obtain the dynamic behavior of the Wolff algorithm: although not conclusively, we propose a scaling law for the dependence of the autocorrelation time on L .

arXiv:1003.3655Journal of Statistical Mechanics Theory and ExperimentApr 16, 20102 citations