Jump to content

Wolff algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Citation bot (talk | contribs) at 14:29, 9 March 2009 (Citation maintenance. Added: title, year, author, journal, volume, pages. You can use this bot yourself! Please report any bugs.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Wolff algorithm 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. (1995), International Journal of Modern Physics C, 6: 197, doi:10.1142/S0129183195000150 {{citation}}: Missing or empty |title= (help)
  • Ferrenberg, Alan M. (1992), "Monte Carlo simulations: Hidden errors from good random number generators", Physical Review Letters, 69: 3382, doi:10.1103/PhysRevLett.69.3382


Stub icon

This physics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Wolff_algorithm&oldid=276038599"