Swendsen–Wang algorithm: Difference between revisions

Revision as of 21:12, 18 December 2016

Revision as of 04:53, 18 January 2017

Line 56:

== Efficiency ==

Although not analiticallyanalytically clear from the original paper, the reason why all the values of z obtained with the SW algorithm are much lower than the exact lower bound for single-spin-flip algortithmsalgorithms (<math>z\geq\gamma/\nu</math>) is that the correlation length divergence is strictly related to the formation of percolation clusters, which are flipped together. In this way the relaxation time is significantly reduced.

The algorithm is not particularly good for simulating [[Geometrical frustration|frustrated systems]].