We prove the rigorous lower bound zexp/ 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.
ASJC Scopus subject areas
- Physics and Astronomy(all)