Editing Cluster algorithms

Jump to navigation Jump to search
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

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 applications is the fact that the [[percolation analysis]] of the clusters can
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 ==
Please note that all contributions to SklogWiki are considered to be released under the Creative Commons Attribution Non-Commercial Share Alike (see SklogWiki:Copyrights for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource. Do not submit copyrighted work without permission!

To edit this page, please answer the question that appears below (more info):

Cancel Editing help (opens in new window)