Cluster algorithms: Difference between revisions
Jump to navigation
Jump to search
| Line 15: | Line 15: | ||
* Consider every pair interacting sites (spins) | * Consider every pair interacting sites (spins) | ||
In the current configuration the pair interaction can be either negative: <math> u_{ij} = - | In the current configuration the pair interaction can be either negative: <math> u_{ij}/k_B T= -K </math> of positive <math> u_{ij}/k_B T = + K </math>, | ||
depending on the product: <math> S_{i} S_{j} </math> | depending on the product: <math> S_{i} S_{j} </math> (See [[Ising Models]] for details on the notation) | ||
== Wolf algorithm == | == Wolf algorithm == | ||
Revision as of 18:15, 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)
In the current configuration the pair interaction can be either negative: of positive , depending on the product: (See Ising Models for details on the notation)
