Statistical mechanics, structure of matter Definition
Swendsen–Wang algorithm
Builds on Ising modelMonte Carlo method in statistical physicsFortuin–Kasteleyn random cluster modelPotts model
Definition
Let be a finite graph, let and , and consider the Ising model on with zero field, with energy for . Let . One step of the Swendsen–Wang algorithm maps a configuration to a random configuration as follows.
- For each edge with , declare it open with probability , independently of the other edges; declare every other edge closed.
- Let the clusters be the connected components of the graph .
- For each cluster independently, choose a value in uniformly at random, and let be this value for every vertex of the cluster.
Remarks
The chain has the Ising measure as a stationary distribution, is irreducible and aperiodic, so it is a valid Monte Carlo method. The reason is the Edwards–Sokal coupling of spins and open edges. Its marginals are the Ising model and the random cluster model with , and clauses 1 and 3 sample its two conditional laws. Example: on the graph with two vertices and one edge, let and be the probabilities that the spins agree or disagree. From an agreeing state the spins still agree after a step with probability ; from a disagreeing state, with probability . Stationarity requires , so , which is the Ising ratio . Non-example: opening edges between equal spins with probability , whatever , breaks the check above unless , so it does not sample the Ising model. For the -state Potts model with energy , the same algorithm works with and a uniform choice among the values.
Reading path
To understand this page from the ground up, read these 7 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Fortuin–Kasteleyn random cluster model concept
- Graph concept
- Ising model example
- Lattice model concept
- Monte Carlo method in statistical physics concept
- Potts model example
- Swendsen–Wang algorithm definition
Further reading
About this page
| Tag | 6HFHVSDN0N |
|---|---|
| URI | m2://6HFHVSDN0N |
| Kind | definition |
| Writing | W0 stub |
| MSC | 82M31, 82B20, 65C05 |
| Defines | Swendsen–Wang algorithm |
| Uses | Ising model, Monte Carlo method in statistical physics, Fortuin–Kasteleyn random cluster model, Potts model |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.