Invaded Cluster Algorithm for Equilibrium Critical Points
From MaRDI portal
Publication:4522101
DOI10.1103/PHYSREVLETT.75.2792zbMATH Open0951.82016arXivcond-mat/9507094WikidataQ52326993 ScholiaQ52326993MaRDI QIDQ4522101FDOQ4522101
Authors:
Publication date: 1 January 2001
Published in: Physical Review Letters (Search for Journal in Brave)
Abstract: A new cluster algorithm based on invasion percolation is described. The algorithm samples the critical point of a spin system without a priori knowledge of the critical temperature and provides an efficient way to determine the critical temperature and other observables in the critical region. The method is illustrated for the two- and three-dimensional Ising models. The algorithm equilibrates spin configurations much faster than the closely related Swendsen-Wang algorithm.
Full work available at URL: https://arxiv.org/abs/cond-mat/9507094
Recommendations
Cites Work
Cited In (11)
- Acquired Clustering Properties and Solution of Certain Saddle Point Systems
- Critical point determination from probability distribution functions in the three dimensional Ising model
- A technique for the estimation of percolation thresholds in lattice systems: application to a problem of granular flow through an orifice
- Random cluster models on the triangular lattice
- The computational complexity of generating random fractals
- Percolation phenomena in low and high density systems
- Application of geometric cluster algorithms
- Application of new Monte Carlo algorithms to random spin systems
- Critical region for droplet formation in the two-dimensional Ising model
- Invaded cluster algorithm for critical properties of periodic and aperiodic planar Ising models
- CLUSTER METHODS FOR ISING SYSTEMS WITH FIELDS
This page was built for publication: Invaded Cluster Algorithm for Equilibrium Critical Points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522101)