Math 2.0

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 G=(V,E)G = (V, E) be a finite graph, let J>0J > 0 and β>0\beta > 0, and consider the Ising model on GG with zero field, with energy H(σ)=−J∑{u,v}∈EσuσvH(\sigma) = -J \sum_{\set{u, v} \in E} \sigma_u \sigma_v for σ∈{−1,+1}V\sigma \in \set{-1, +1}^V. Let p=1−e−2βJp = 1 - e^{-2 \beta J}. One step of the Swendsen–Wang algorithm maps a configuration σ\sigma to a random configuration σ′\sigma' as follows.

  1. For each edge {u,v}\set{u, v} with σu=σv\sigma_u = \sigma_v, declare it open with probability pp, independently of the other edges; declare every other edge closed.
  2. Let the clusters be the connected components of the graph (V,open edges)(V, \text{open edges}).
  3. For each cluster independently, choose a value in {−1,+1}\set{-1, +1} uniformly at random, and let σv′\sigma'_v be this value for every vertex vv 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 q=2q = 2, and clauses 1 and 3 sample its two conditional laws. Example: on the graph with two vertices and one edge, let πa\pi_a and πd\pi_d be the probabilities that the spins agree or disagree. From an agreeing state the spins still agree after a step with probability p+(1−p)/2=(1+p)/2p + (1 - p)/2 = (1 + p)/2; from a disagreeing state, with probability 1/21/2. Stationarity requires πa(1−p)/2=πd/2\pi_a (1 - p)/2 = \pi_d / 2, so πa/πd=1/(1−p)=e2βJ\pi_a / \pi_d = 1/(1 - p) = e^{2\beta J}, which is the Ising ratio eβJ/e−βJe^{\beta J} / e^{-\beta J}. Non-example: opening edges between equal spins with probability 1/21/2, whatever β\beta, breaks the check above unless e2βJ=2e^{2\beta J} = 2, so it does not sample the Ising model. For the qq-state Potts model with energy −J∑δ(σu,σv)-J \sum \delta(\sigma_u, \sigma_v), the same algorithm works with p=1−e−βJp = 1 - e^{-\beta J} and a uniform choice among the qq 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Fortuin–Kasteleyn random cluster model concept
  2. Graph concept
  3. Ising model example
  4. Lattice model concept
  5. Monte Carlo method in statistical physics concept
  6. Potts model example
  7. Swendsen–Wang algorithm definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Swendsen%E2%80%93Wang_algorithm
About this page
Tag6HFHVSDN0N
URIm2://6HFHVSDN0N
Kinddefinition
WritingW0 stub
MSC82M31, 82B20, 65C05
DefinesSwendsen–Wang algorithm
UsesIsing model, Monte Carlo method in statistical physics, Fortuin–Kasteleyn random cluster model, Potts model
Changed3 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.