Cluster algorithms: Difference between revisions
Jump to navigation
Jump to search
| Line 17: | Line 17: | ||
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>, | 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> (See [[Ising Models]] for details on the notation) | depending on the product: <math> S_{i} S_{j} </math> (See [[Ising Models]] for details on the notation) | ||
* For pairs with <math> u_{ij}/k_B T < 0 </math> create a bond between the two spins with a given probability <math> p </math> | |||
== Wolf algorithm == | == Wolf algorithm == | ||
Revision as of 19:19, 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)
- For pairs with create a bond between the two spins with a given probability
