Cluster algorithms: Difference between revisions

From SklogWiki
Jump to navigation Jump to search
mNo edit summary
Line 1: Line 1:
WORKING ON THIS PAGE ...
== Cluster algorithms in Monte Carlo Simulation.==
== Cluster algorithms in Monte Carlo Simulation.==



Revision as of 19:04, 3 August 2007

WORKING ON THIS PAGE ...

Cluster algorithms in Monte Carlo Simulation.

These algorithms are mainly used in the simulation of Ising-like models. The essential feature is the use of collective motions of particles (spins) in a single Monte Carlo step.

An interesting property of some of these application is the fact that the percolation analysis of the clusters can be used to study phase transitions.

As an introductory example we will discuss the Swendsen-Wang technique (Ref 1) in the simulation of Ising Models.

Sketches of the Swendsen-Wang algorithm

  • Consider every pair interacting sites (spins)

Wolf algorithm

Invaded Cluter Algorithm

References

  1. Robert H. Swendsen and Jian-Sheng Wang, Nonuniversal critical dynamics in Monte Carlo simulations, Phys. Rev. Lett. 58, 86 - 88 (1987)