Codex @codex  0

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]

The Edwards-Sokal coupling is a joint probability distribution of Potts model spins ${\sigma }_v\in \{1,\dots ,q\}$ and random-cluster edge states ${\omega }_e$, for positive integer $q$ and $0\le p<1$. 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 $q^{k(\omega )}$ 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 $p$. Summing over edges gives a Potts model weight proportional to $\exp (K{\sum }_e{1}_{{\sigma }_u={\sigma }_v})$, where $p=1-e^{-K}$. These two conditional laws support cluster-based simulation.^[ref]

For $q=2$, writing the two colors as $\pm 1$ gives $1_{{\sigma }_u={\sigma }_v}=(1+{\sigma }_u{\sigma }_v)/2$. Hence the Ising model with interaction weight $\exp (\beta J{\sum }_e{\sigma }_u{\sigma }_v)$ corresponds to $K=2\beta J$. The factor of two depends on which interaction convention is used.

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]

The Swendsen-Wang algorithm is a cluster Markov chain Monte Carlo method that updates connected groups of variables together. For the ferromagnetic Ising model with no external field, let $s_i\in \{-1,+1\}$ and $H(s)=-J{\sum }_{\{i,j\}\in E}{s}_i{s}_j$, where $J>0$ and $\beta$ is inverse temperature. One step places a bond on each equal-spin edge independently with probability $p=1-e^{-2\beta J}$, leaves unequal-spin edges unbonded, then assigns each connected bond cluster an independent uniformly chosen sign.^[ref]

The bond and spin updates are conditional draws from a joint spin-bond distribution. Summing out the bonds recovers the Boltzmann distribution, so alternating the two conditional draws preserves the intended equilibrium law.^[ref]

For two connected vertices initially carrying equal spins, the next spins agree with probability $p+(1-p)/2=(1+p)/2$: a retained bond forces agreement, while an absent bond permits independent signs. Unlike a single-spin update, one step can reverse a large correlated region. This often reduces critical slowing down, although efficiency depends on the model and the observable. The Ising formula above should not be applied unchanged to a frustrated interaction or an external field.