Rigorous lower bound on the dynamic critical exponent of some multilevel Swendsen-Wang algorithms

Journal Article · Mon Sep 16 04:00:00 EDT 1991 · Physical Review Letters; (United States)

DOI:https://doi.org/10.1103/PhysRevLett.67.1482· OSTI ID:5242817

Li, X; Sokal, A D ^[1]

---

1. Department of Physics, New York University, 4 Washington Place, New York, New York (USA)

We prove the rigorous lower bound {ital z}{sub exp}{ge}{alpha}/{nu} 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.

• DOE Contract Number: FG02-90ER40581
• OSTI ID: 5242817
• Journal Information: Physical Review Letters; (United States), Journal Name: Physical Review Letters; (United States) Vol. 67:12; ISSN PRLTA; ISSN 0031-9007
• Country of Publication: United States
• Language: English

Related Subjects

36 MATERIALS SCIENCE
360104 -- Metals & Alloys-- Physical Properties
657002* -- Theoretical & Mathematical Physics-- Classical & Quantum Mechanics
71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
ALGORITHMS
CORRELATIONS
FERROMAGNETISM
LIMITING VALUES
MAGNETISM
MARKOV PROCESS
MATHEMATICAL LOGIC
MONTE CARLO METHOD
STOCHASTIC PROCESSES