Statistical mechanics, structure of matter Computational and analytical techniques Concept
Wolff algorithm
Summary
The Wolff algorithm is a single-cluster Monte Carlo method for spin models such as the Ising model. It grows one cluster of aligned spins from a random seed, using the same bond probability as the Swendsen–Wang algorithm, and flips the whole cluster. Every proposed flip is accepted, and large clusters are flipped more often because a random seed is more likely to land in them. Near the critical point it reduces critical slowing down even more than Swendsen–Wang in many models.
Further reading
About this page
| Tag | A9VN0WNG00 |
|---|---|
| URI | m2://A9VN0WNG00 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 82M31, 82B20, 65C05 |
| Specializes | Monte Carlo method in statistical physics |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.