Efficient simulation of the random-cluster model
arXiv:1307.6647 · doi:10.1103/PhysRevE.88.033303
Abstract
The simulation of spin models close to critical points of continuous phase transitions is heavily impeded by the occurrence of critical slowing down. A number of cluster algorithms, usually based on the Fortuin-Kasteleyn representation of the Potts model, and suitable generalizations for continuous-spin models have been used to increase simulation efficiency. The first algorithm making use of this representation, suggested by Sweeny in 1983, has not found widespread adoption due to problems in its implementation. However, it has been recently shown that it is indeed more efficient in reducing critical slowing down than the more well-known algorithm due to Swendsen and Wang. Here, we present an efficient implementation of Sweeny's approach for the random-cluster model using recent algorithmic advances in dynamic connectivity algorithms.
arXiv commentRevTeX 4.1, 14 pages, 8 figures, 3 tables, version as published
References in corpus (19)
- A fast Monte Carlo algorithm for site or bond percolation
- The Random-Cluster Model
- Monte Carlo errors with less errors
- The Number of Incipient Spanning Clusters in Two-Dimensional Percolation
- Spanning forests and the q-state Potts model in the limit q \to 0
- Shortest-Path Fractal Dimension for Percolation in Two and Three Dimensions
- Error estimation and reduction with cross correlations
- Simulation of Potts models with real q and no critical slowing down
- Pair Connectedness and Shortest Path Scaling in Critical Percolation
- Some geometric critical exponents for percolation and the random-cluster model
- Exact critical exponent for the shortest-path scaling function in percolation
- Dynamic critical behavior of the Chayes-Machta-Swendsen-Wang algorithm
- Critical speeding-up in a local dynamics for the random-cluster model
- Dynamic Critical Behavior of the Chayes-Machta Algorithm for the Random-Cluster Model. I. Two Dimensions
- Comments on Sweeny and Gliozzi dynamics for simulations of Potts models in the Fortuin-Kasteleyn representation
- Random-cluster multi-histogram sampling for the q-state Potts model
- Generalized-ensemble simulations and cluster algorithms
- Conformal Curves in Potts Model: Numerical Calculation
- Duality of critical interfaces in Potts model: numerical check
Cited by in corpus (13)
- Cluster Monte Carlo and dynamical scaling for long-range interactions
- Corner contribution to cluster numbers in the Potts model
- Fragmentation of fractal random structures
- Solution of the sign problem in the Potts model at fixed fermion number
- Active spanning trees and Schramm-Loewner evolution
- Bridges in the random-cluster model
- Percolation of the Site Random-Cluster Model by Monte Carlo Method
- Dynamic connectivity algorithms for Monte Carlo simulations of the random-cluster model
- On the coupling time of the heat-bath process for the Fortuin-Kasteleyn random-cluster model
- Sweeny dynamics for the random-cluster model with small
- Universality of the complete-graph Potts model with
- Comparison of the clock, stochastic cutoff, and Tomita Monte Carlo methods in simulating the dipolar triangular lattice at criticality
- Critical points of the random cluster model with Newman-Ziff sampling