Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review Letters

Swendsen Responds

Robert H. Swendsen

Published May 26, 1986• 9 citations
Publisher
DOI
10.1103/physrevlett.56.2333

Related papers

Möller and Otto Respond

H. Möller, Andreas Otto

Physical Review Letters•Jun 29, 1981•7 citations

Gisin Responds

Nicolas Gisin

Physical Review Letters•Oct 29, 1984•52 citations

ScalingAnsatzfor Swendsen-Wang Dynamics

W. Klein, Tane S. Ray, Pablo Tamayo

Using cluster and percolation concepts, we obtain a relation between relaxation times at critical points obtained from a new dynamical model introduced by Swendsen and Wang and those obtained from Glauber dynamics. This relation, which involves only static critical exponents, provides new insight into the physics underlying cluster acceleration methods such as the one introduced by Swendsen and Wang.

Physical Review Letters•Jan 9, 1989•37 citations

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

Xiao-Jian Li, Alan D. Sokal

We prove the rigorous lower bound ${\mathit{z}}_{\mathrm{exp}}$\ensuremath{\ge}\ensuremath{\alpha}/\ensuremath{\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.

Physical Review Letters•Sep 16, 1991•15 citations

Lin and Ballentine reply

W. A. Lin, L. E. Ballentine

Physical Review Letters•Jul 1, 1991•10 citations

PHILIPPE NOZIÈRES REPLIES

Recent Progress in Many-Body Theories•Dec 1, 2002•0 citations
We prove the rigorous lower bound zexp{\mathit{z}}_{\mathrm{exp}}zexp​\ensuremath{\ge}\ensuremath{\alpha}/\ensuremath{\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.