A. D. Sokal 2026-11-05
A. D. Sokal, identified as Alan D. Sokal in the publisher byline, coauthored the Edwards-Sokal coupling with R. G. Edwards. Their joint spin-and-bond representation links the Potts model to the random-cluster model and supports cluster algorithms for Monte Carlo simulation. It allows the same joint probability law to be viewed through either spin or bond variables.[ref]
Edwards-Sokal coupling Created 2026-09-24 Updated 2026-11-05
The Edwards-Sokal coupling is a joint probability distribution of Potts model spins and random-cluster edge states , for positive integer and . On a finite graph, its unnormalized weight isGiven the edge configuration, assign each open connected component of a graph an independent uniform color. There are compatible spin assignments, so summing over spins gives the random-cluster measure.
Given the spins, edges joining unequal colors are closed; each edge joining equal colors is independently open with probability . Summing over edges gives a Potts model weight proportional to , where . These two conditional laws support cluster-based simulation.[ref]
Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm by R. G. Edwards and A. D. Sokal. Joint spin-bond representation and its two conditional distributions, Physical Review D 38 (1988), pages 2009–2012
For , writing the two colors as gives . Hence the Ising model with interaction weight corresponds to . The factor of two depends on which interaction convention is used.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 38 3 Solution Created 2026-10-03 Updated 2026-10-14
Let be the number of open edges, the number of connected components in the open subgraph, counting isolated vertices, and . Summing the joint weight over spins requires a constant spin on every open component. There are exactly choices. Thus the edge marginal isThis is the random-cluster measure, and the joint normalizing constant is .
Summing instead over edge configurations factors independently over edges. For a fixed spin configuration the resulting weight issince . The factor is independent of the spins. Hence the spin marginal is exactly the ferromagnetic Potts measure in the conventionIts partition function satisfies .
Conditionally on , edge states are independent: an edge with different endpoint spins is closed with probability one, while one with equal endpoint spins is open with probability . Conditionally on , color its open components independently and uniformly from . Equivalently, every compatible spin configuration has conditional probability , and all incompatible configurations have probability zero. These are the two conditional laws of the Edwards-Sokal coupling.
If belong to the same open component, their colors agree surely; otherwise the two independent component colors agree with probability . ThereforeRearranging proves the spin-connectivity identity for the Potts model:
Phase transitions refer to infinite-volume limits, not a single finite graph. The identity shows that connectivity is exactly the excess spin agreement above its independent-color baseline. More directly, use a wired random-cluster boundary condition and fix the corresponding boundary spin to color . Its component has color , while every finite component has a uniform color. In the compatible infinite-volume coupling,Consequently normalized spontaneous magnetization isThe onset of a wired infinite cluster and the onset of spontaneous magnetization in the Potts model are the same transition under , giving . This also transfers any jump or continuity of that order parameter between the two descriptions; it makes no assumption about behavior exactly at the critical point.
Periodic Potts chain 2026-10-25
The ferromagnetic Potts model on a labelled ring has possible site states, and . Its spin-chain transfer matrix is , with the -dimensional all-ones matrix. The canonical partition function is . The convention counts two bonds when .
Potts model Created 2026-10-14 Updated 2026-11-05
The ferromagnetic Potts model on a finite graph assigns possible states to each graph vertex and rewards neighbouring equal states by the displayed weight, for . The interaction sum counts each unoriented edge once. The Edwards-Sokal coupling identifies its spin clusters with the random-cluster model at and integer .
Random-cluster model Created 2026-09-24 Updated 2026-11-05
On a finite graph , the random-cluster model weights an open-edge configuration byThe partition function is the sum of these weights, and counts the open connected components of a graph, including isolated graph vertices. The endpoint laws at and are obtained by limits. The factor is the cluster weight in the random-cluster model.[ref]
On the random-cluster model. I. Introduction and relation to other models by C. M. Fortuin and P. W. Kasteleyn. Finite-graph random-cluster measure and relation to other lattice models
At , the component factor disappears and the law is independent bond percolation. For other , is a model parameter rather than necessarily the marginal opening probability of each edge. For a single edge joining two vertices, with , the closed and open weights are and , so the edge is open with probability .
The random-cluster single-edge conditional probability describes the local mechanism. The Edwards-Sokal coupling connects integer cluster weights with the Potts model, while random-cluster boundary conditions specify how boundary vertices are identified before component counting.
R. G. Edwards 2026-11-05
R. G. Edwards, identified as Robert G. Edwards in the publisher byline, coauthored the Edwards-Sokal coupling with A. D. Sokal. The construction combines spin and bond variables in one joint probability law, connecting the Potts model and the random-cluster model. This supplies the probabilistic basis for changing entire clusters in a Monte Carlo method.[ref]
Spin-connectivity identity for the Potts model Created 2026-10-14 Updated 2026-11-05
For integer , given a random-cluster configuration, its components receive independent uniform colors under the Edwards-Sokal coupling. Two vertices have equal Potts spins with probability if connected and otherwise. Averaging proves the identity. With a wired component fixed to color , the same argument gives normalized spontaneous magnetization in infinite volume. Thus its onset is the wired random-cluster critical probability, with dimensionless Potts model coupling in the convention of the Edwards-Sokal coupling.
For , the equal-spin probability is identically one and the first identity reduces to . The normalized magnetization expression divides by and therefore does not apply to that degenerate one-color case. The conversion to a physical Ising model inverse temperature must also account for the interaction convention.