Invaded Cluster Algorithm for Equilibrium Critical Points
From MaRDI portal
Publication:4522101
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.
Recommendations
Cites work
Cited in
(11)- A technique for the estimation of percolation thresholds in lattice systems: application to a problem of granular flow through an orifice
- Application of geometric cluster algorithms
- The computational complexity of generating random fractals
- Critical region for droplet formation in the two-dimensional Ising model
- Critical point determination from probability distribution functions in the three dimensional Ising model
- CLUSTER METHODS FOR ISING SYSTEMS WITH FIELDS
- Percolation phenomena in low and high density systems
- Random cluster models on the triangular lattice
- Acquired Clustering Properties and Solution of Certain Saddle Point Systems
- Invaded cluster algorithm for critical properties of periodic and aperiodic planar Ising models
- Application of new Monte Carlo algorithms to random spin systems
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)