Mean Field Behavior of Cluster Dynamics

Abstract

The dynamic behavior of cluster algorithms is analyzed in the classical mean field limit. Rigorous analytical results below $T_c$ establish that the dynamic exponent has the value $z_{sw}=1$ for the Swendsen-Wang algorithm and $z_{uw}=0$ for the Wolff algorithm. An efficient Monte Carlo implementation is introduced, adapted for using these algorithms for fully connected graphs. Extensive simulations both above and below $T_c$ demonstrate scaling and evaluate the finite-size scaling function by means of a rather impressive collapse of the data.

Revtex, 9 pages with 7 figures

Cited by in corpus (9)

• Irreversible Monte Carlo Algorithms for Efficient Sampling
• Dynamic critical behavior of the Swendsen--Wang Algorithm for the three-dimensional Ising model
• Dynamic critical behavior of the Chayes-Machta-Swendsen-Wang algorithm
• Barriers and Dynamical Paths in Alternating Gibbs Sampling of Restricted Boltzmann Machines
• Anomalous mean-field behavior of the fully connected Ising model
• Cluster Monte Carlo and dynamical scaling for long-range interactions
• Dynamic Critical Behavior of the Chayes-Machta Algorithm for the Random-Cluster Model. I. Two Dimensions
• Dynamical Critical Behaviors of the Ising Spin Chain: Swendsen-Wang and Wolff Algorithms
• Synchronization transition in space-time chaos in the presence of quenched disorder