arXiv · cond-mat/9603134
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
N. Persky, R. Ben-Av, I. Kanter, E. Domany. 1996-03-24. Mean Field Behavior of Cluster Dynamics. https://doi.org/10.1103/physreve.54.2351
Cite the original work for its findings. Save a collection to share your selection of sources.