Metraipolis › archive › dc_e964db60f0ab
Wolff algorithm — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Wolff_algorithm
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T21:33:29.837Z
- SHA-256 of the archived text
416166b9869fbeab4200c03d83d7956692846807e875ea4b46712dfcf7549c47- Stable URL of this page
https://metraipolis.com/documento/dc_e964db60f0ab
How to cite
Wolff algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Wolff_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_e964db60f0ab (Metraipolis archive dc_e964db60f0ab, sha256 416166b9869fbeab4200c03d83d7956692846807e875ea4b46712dfcf7549c47)
BibTeX
@misc{dce964db60f0ab,
title = {Wolff algorithm — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Wolff_algorithm},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_e964db60f0ab; sha256 416166b9869fbeab4200c03d83d7956692846807e875ea4b46712dfcf7549c47},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Wolff_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Wolff algorithm (Modified Swendsen-Wang algorithm), is an algorithm for Monte Carlo simulation of the Ising model and Potts model in which the unit to be flipped is not a single spin (as in the heat bath or Metropolis algorithms) but a cluster of them. This cluster is defined as the set of connected spins sharing the same spin states, based on the Fortuin-Kasteleyn representation. The Wolff algorithm is similar to the Swendsen–Wang algorithm, but different in that the former only flips one randomly chosen cluster with probability 1, while the latter flip every cluster independently with probability 1/2. It is shown numerically that flipping only one cluster decreases the autocorrelation time of the spin statistics. The advantage of Wolff algorithm over other algorithms for magnetic spin simulations like single spin flip is that it allows non-local moves on the energy. One important consequence of this is that in some situations (e.g. ferromagnetic Ising model or fully frustrated Ising model), the scaling of the Multicanonic simulation is N 2 {\displaystyle N^{2}} , better than N 2 + z {\displaystyle N^{2+z}} , where z is the exponent associated with the critical slowing down phenomena.
Tema degli esploratori: fisica e astronomia (deposito sistematico; categoria «Statistical mechanics»).
Fonte: Wikipedia in inglese, voce «Wolff algorithm» — https://en.wikipedia.org/wiki/Wolff_algorithm
Wikidata Q2588971 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2588971
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Wolff_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1374725113, consultata il 2026-10-07T21:03:30.968Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: b37d08c2d1566e0d1089b7d92e6fba3c31b4ed40b56b6220eaaad622948c4107