Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1204.4353 · Physica A Statistical Mechanics and its Applications

Dynamical behavior of the Niedermayer algorithm applied to Potts models

D. Girardi, T. J. P. Penna, N. S. Branco

Published Mar 17, 2012• 0 citations
arXivHTMLPDF
DOI
10.1016/j.physa.2012.03.011

Related papers

Dynamic critical behavior of the Swendsen-Wang algorithm: The two-dimensional three-state Potts model revisited

Jesús Salas, Alan D. Sokal

arXiv:hep-lat/9605018•Journal of Statistical Physics•Apr 1, 1997•41 citations

Dynamical Behavior of Persistent Spins in the Triangular Potts Model: A Large-Scale Monte Carlo Study

Michael Hennecke

Springer eBooks•Jan 1, 1999•0 citations

A comparison of cluster algorithms for Potts models

Paul Coddington, CLIVE F. BAILLIE

Nuclear Physics B - Proceedings Supplements•Sep 1, 1990•4 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.3655•Journal of Statistical Mechanics Theory and Experiment•Apr 16, 2010•2 citations

Dynamics of clusters in the two-dimensional Potts model

Y. Gündüç, M. Aydin

arXiv:hep-lat/9605015•Physica A Statistical Mechanics and its Applications•Oct 1, 1996•3 citations

Single-cluster dynamics for the random-cluster model

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

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.

arXiv:0907.1711•Physical Review E•Sep 30, 2009•4 citations
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 .
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.