6533b7defe1ef96bd1276914
RESEARCH PRODUCT
Efficient simulation of the random-cluster model
Martin WeigelEren Metin Elçisubject
Continuous phase modulationRandom clusterStatistical Mechanics (cond-mat.stat-mech)Critical phenomenaMonte Carlo methodHigh Energy Physics - Lattice (hep-lat)FOS: Physical sciencesComputational Physics (physics.comp-ph)CombinatoricsHigh Energy Physics - LatticeCluster (physics)Representation (mathematics)Physics - Computational PhysicsAlgorithmCondensed Matter - Statistical MechanicsMathematicsPotts modeldescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2013-07-25 |