Rigorous lower bound on the dynamic critical exponent of some multilevel Swendsen-Wang algorithms
- 16 September 1991
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 67 (12) , 1482-1485
- https://doi.org/10.1103/physrevlett.67.1482
Abstract
We prove the rigorous lower bound ≥α/ν for the dynamic critical exponent of a broad class of multilevel (or ‘‘multigrid’’) variants of the Swendsen-Wang algorithm. This proves that such algorithms do suffer from critical slowing down. We conjecture that such algorithms in fact lie in the same dynamic universality class as the stanard Swendsen-Wang algorithm.
Keywords
This publication has 16 references indexed in Scilit:
- How to beat critical slowing-down: 1990 updateNuclear Physics B - Proceedings Supplements, 1991
- General cluster Monte Carlo dynamicsPhysical Review B, 1991
- Critical dynamics of the Swendsen-Wang algorithm in the three-dimensional Ising modelPhysica A: Statistical Mechanics and its Applications, 1990
- System size dependence of the autocorrelation time for the Swendsen-Wang Ising modelPhysica A: Statistical Mechanics and its Applications, 1990
- Comparison between cluster Monte Carlo algorithms in the Ising modelPhysics Letters B, 1989
- Rigorous lower bound on the dynamic critical exponents of the Swendsen-Wang algorithmPhysical Review Letters, 1989
- Simulations without critical slowing down: Ising and three-state Potts modelsPhysical Review B, 1989
- Mean-field study of the Swendsen-Wang dynamicsPhysical Review A, 1989
- Simulations without critical slowing downPhysical Review Letters, 1988
- Nonuniversal critical dynamics in Monte Carlo simulationsPhysical Review Letters, 1987