Random-cluster model (Fortuin–Kasteleyn percolation)
The random-cluster model (also called FK percolation) is a probability measure on bond configurations on a finite graph (typically a finite region of a lattice such as a finite box in a lattice with nearest-neighbor edges ).
A configuration is
- either a subset of edges (the open edges), or equivalently
- an element of (edge “spins”), so it fits the general idea of a spin configuration with spin space per edge.
Let be the number of open edges, and let be the number of connected components (clusters) in the spanning subgraph , counting isolated vertices as single-vertex clusters.
For parameters and , the random-cluster measure on is the probability measure
where the normalizing constant
is the random-cluster partition function, the analogue of the lattice partition function .
Boundary conditions (free vs wired)
On a finite subgraph cut out of an infinite lattice, one often specifies boundary conditions (compare boundary conditions ). For random-cluster models the standard choices are:
- Free boundary condition: clusters are computed using only edges inside the region.
- Wired boundary condition: boundary vertices are identified (“wired together”) before counting clusters, which favors connections to the boundary.
These boundary conditions produce different finite-volume measures, and they are central when taking thermodynamic limits and defining infinite-volume objects (compare infinite-volume Gibbs measures ).
Fortuin–Kasteleyn link to Potts and Ising
The model is designed so that, for integer , it is exactly the graphical expansion of the q-state Potts model (and for the Ising model ).
On a graph with uniform ferromagnetic coupling at inverse temperature , the FK parameter is
In this correspondence, the random-cluster partition function matches the Potts partition function up to an explicit factor, and the cluster-weight has a clear meaning: after choosing , each cluster can be assigned one of spin labels independently, giving possible spin assignments.
A useful consequence (often phrased via the Edwards–Sokal coupling) is that connectivity events encode Potts correlations: the event “ is connected to by open edges” controls the probability that Potts spins at and are equal under the corresponding Potts measure.
Key properties
Special cases
- : the factor is constant, so is independent bond percolation with edge-open probability .
- : corresponds to the Ising model (FK representation).
- Non-integer : still defines a perfectly good probability model on edges, even though there is no literal -state spin interpretation.
Positive association and monotonicity (for )
For , the random-cluster model satisfies strong correlation inequalities (FKG-type positive association). Informally:
- increasing events are positively correlated,
- the model is monotone in ,
- wired boundary conditions typically dominate free boundary conditions for increasing events.
These monotonicity properties are a major reason the model is a standard tool for proving existence and structure of phase transitions.
Domain Markov / specification viewpoint
Although the weight involves the global quantity , the model still has a consistent “conditional distribution in a subregion given the outside configuration,” i.e. a specification in the sense of Gibbs specifications . This supports an infinite-volume formulation analogous to the DLR equation approach used for lattice spin systems.
Thermodynamic quantities
On boxes in with edge set , one defines the finite-volume free-energy density / pressure via
leading to the lattice pressure and its thermodynamic limit when the limit exists.
Non-analytic behavior of this limit as a function of corresponds to a phase transition .
Physical interpretation
- The configuration describes which bonds are “active.” For Potts/Ising systems, open edges represent bonds that are compatible with (or reinforce) local alignment.
- Clusters in represent domains of aligned spins in the coupled Potts picture.
- The parameter controls the entropic weight of forming new clusters:
- larger favors having many clusters (more internal label choices),
- larger favors opening edges and merging clusters.
- Long-range order can be read as large-scale connectivity:
- the emergence of macroscopic clusters is tied to an order parameter ,
- in Potts/Ising language, this corresponds to spontaneous magnetization and spontaneous symmetry breaking .
Because it translates spin ordering questions into geometric connectivity questions, the random-cluster model is a central bridge between lattice spin systems and percolation-style geometry, and it provides geometric access to quantities like two-point correlations , correlation length , and susceptibility through cluster connectivity and cluster-size statistics.