Wolff algorithm
 | It has been suggested that this article be merged with Swendsen-Wang algorithm and talk:Swendsen-Wang algorithm. (Discuss) Proposed since March 2009. |
The Wolff algorithm, named after Ulli Wolff, is an algorithm for Monte Carlo simulation of the Ising model in which an equal-spin cluster is formed around one spin. That cluster is then flipped. The Wolff algorithm is an improvement over the Swendsen–Wang algorithm because it tends to form bigger clusters.
References
- Wolff, Ulli (1989), "Collective Monte Carlo Updating for Spin Systems", Physical Review Letters, 62: 361, doi:10.1103/PhysRevLett.62.361
- Bae, S.; Ko, S.H.; Coddington, P.D. (1995), "Parallel Wolff cluster algorithms", International Journal of Modern Physics C, 6: 197, doi:10.1142/S0129183195000150
- Ferrenberg, Alan M.; Landau, D.P.; Wong, Y. Joanna (1992), "Monte Carlo simulations: Hidden errors from good random number generators", Physical Review Letters, 69: 3382, doi:10.1103/PhysRevLett.69.3382
External links
 | This physics-related article is a stub. You can help Wikipedia by expanding it. |