Comparison of cluster algorithms for two-dimensional Potts models
- 1 May 1991
- journal article
- Published by American Physical Society (APS) in Physical Review B
- Vol. 43 (13) , 10617-10621
- https://doi.org/10.1103/physrevb.43.10617
Abstract
We have measured the dynamical critical exponent z for the Swendsen-Wang and the Wolff cluster update algorithms, as well as a number of variants of these algorithms, for the q=2 and q=3 Potts models in two dimensions. We find that although the autocorrelation times differ considerably between algorithms, the critical exponents are the same. For q=2, we find that although the data are better fitted by a logarithmic increase in the autocorrelation time with lattice size, they are also consistent with a power law with exponent z≊0.25, especially if there are non-negligible corrections to scaling.Keywords
This publication has 16 references indexed in Scilit:
- A comparison of cluster algorithms for Potts modelsNuclear Physics B - Proceedings Supplements, 1990
- Asymptotic freedom and mass generation in the O(3) nonlinear σ-modelNuclear Physics B, 1990
- Collective Monte Carlo Updating for Spin SystemsPhysical Review Letters, 1989
- The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walkJournal of Statistical Physics, 1988
- Nonuniversal critical dynamics in Monte Carlo simulationsPhysical Review Letters, 1987
- The Potts modelReviews of Modern Physics, 1982
- Percolation theoryReports on Progress in Physics, 1980
- Scaling theory of percolation clustersPhysics Reports, 1979
- On the random-cluster modelPhysica, 1972
- Some generalized order-disorder transformationsMathematical Proceedings of the Cambridge Philosophical Society, 1952