Content deleted Content added
No edit summary |
added a small motivation on why wolff algorithm is relevant. |
||
Line 2:
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.
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 <math>N^2</math>, better than <math>N^{2+z}</math>, where z is the exponent associated with the critical slowing down phenomena.
==References==
| |||