Cluster algorithms: Difference between revisions
Jump to navigation
Jump to search
mNo edit summary |
mNo edit summary |
||
| Line 1: | Line 1: | ||
Cluster algorithms in Monte Carlo Simulation. | 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 | These algorithms are mainly used in the simulation of [[Ising Models|Ising-like models]]. The essential feature is the use of collective motions | ||
of ''particles (spins)'' in a single Monte Carlo step. | of ''particles (spins)'' in a single Monte Carlo step. | ||
| Line 8: | Line 8: | ||
As an introductory example we will discuss the Swendsen-Wang technique in the simulation of Ising models (Ref 1) | As an introductory example we will discuss the Swendsen-Wang technique in the simulation of Ising models (Ref 1) | ||
== Wolf algorithm == | |||
== Invaded Cluter Algorithm == | |||
== References == | |||
Revision as of 17:55, 3 August 2007
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 in the simulation of Ising models (Ref 1)