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

Xiao Jian Li; Alan D. Sokal

doi:10.1103/PhysRevLett.67.1482

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

Xiao Jian Li, Alan D. Sokal

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	1482-1485
Number of pages	4
Journal	Physical Review Letters
Volume	67
Issue number	12
DOIs	https://doi.org/10.1103/PhysRevLett.67.1482
State	Published - 1991

ASJC Scopus subject areas

General Physics and Astronomy

Access to Document

10.1103/PhysRevLett.67.1482

Cite this

@article{7a5383caa6094afd8ea50c72db5ff7c6,

title = "Rigorous lower bound on the dynamic critical exponent of some multilevel Swendsen-Wang algorithms",

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.",

author = "Li, {Xiao Jian} and Sokal, {Alan D.}",

year = "1991",

doi = "10.1103/PhysRevLett.67.1482",

language = "English (US)",

volume = "67",

pages = "1482--1485",

journal = "Physical Review Letters",

issn = "0031-9007",

publisher = "American Physical Society",

number = "12",

}

TY - JOUR

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

AU - Li, Xiao Jian

AU - Sokal, Alan D.

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=4244021399&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4244021399&partnerID=8YFLogxK

U2 - 10.1103/PhysRevLett.67.1482

DO - 10.1103/PhysRevLett.67.1482

M3 - Article

AN - SCOPUS:4244021399

SN - 0031-9007

VL - 67

SP - 1482

EP - 1485

JO - Physical Review Letters

JF - Physical Review Letters

IS - 12

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this