Invaded cluster algorithm for Potts models
Authors:
Preprint
Abstract
The invaded cluster algorithm, a new method for simulating phase transitions, is described in detail. Theoretical, albeit nonrigorous, justification of the method is presented and the algorithm is applied to Potts models in two and three dimensions. The algorithm is shown to be useful for both first-order and continuous transitions and evidently provides an efficient way to distinguish between these possibilities. The dynamic properties of the invaded cluster algorithm are studied. Numerical evidence suggests that the algorithm has no critical slowing for Ising models.Keywords
All Related Versions
- Version 1, 1996-05-16, ArXiv
- Published version: Physical Review E, 54 (2), 1332.
This publication has 27 references indexed in Scilit:
- MC-simulation of the 3D,q=3 Potts modelZeitschrift für Physik B Condensed Matter, 1994
- Finite-size scaling for Potts modelsJournal of Statistical Physics, 1991
- Comparison between cluster Monte Carlo algorithms in the Ising modelPhysics Letters B, 1989
- Discontinuity of the magnetization in one-dimensional 1/ x?y 2 Ising and Potts modelsJournal of Statistical Physics, 1988
- The stochastic geometry of invasion percolationCommunications in Mathematical Physics, 1985
- First-order phase transitions in large entropy lattice modelsCommunications in Mathematical Physics, 1982
- Capillary displacement and percolation in porous mediaJournal of Fluid Mechanics, 1982
- Percolation points and critical point in the Ising modelJournal of Physics A: General Physics, 1977
- Potts model at the critical temperatureJournal of Physics C: Solid State Physics, 1973
- On the random-cluster modelPhysica, 1972