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

Xiao Jian Li, Alan D. Sokal

    Research output: Contribution to journalArticlepeer-review

    Abstract

    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.

    Original languageEnglish (US)
    Pages (from-to)1482-1485
    Number of pages4
    JournalPhysical Review Letters
    Volume67
    Issue number12
    DOIs
    StatePublished - 1991

    ASJC Scopus subject areas

    • Physics and Astronomy(all)

    Fingerprint Dive into the research topics of 'Rigorous lower bound on the dynamic critical exponent of some multilevel Swendsen-Wang algorithms'. Together they form a unique fingerprint.

    Cite this