Swendsen–Wang algorithm: Difference between revisions

Content deleted Content added
Line 55:
Although not analytically 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 algorithms (<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 particularlyefficient good forin simulating [[Geometrical frustration|frustrated systems]].
 
==References==