Editing Cluster algorithms
Jump to navigation
Jump to search
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 1: | Line 1: | ||
'''Cluster algorithms''' are mainly used in the simulation of [[Ising Models|Ising-like models]] using [[Monte Carlo|Monte Carlo]] methods. The essential feature is the use of collective motions of particles (spins) in a single [[Monte Carlo]] step. | '''Cluster algorithms''' are mainly used in the simulation of [[Ising Models|Ising-like models]] using [[Monte Carlo|Monte Carlo]] methods. 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 | 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]]. | be used to study [[phase transitions]]. | ||
== Swendsen-Wang algorithm == | == Swendsen-Wang algorithm == |