Random cluster model explained
In statistical mechanics, probability theory, graph theory, etc. the random cluster model is a random graph that generalizes and unifies the Ising model, Potts model, and percolation model. It is used to study random combinatorial structures, electrical networks, etc.[1] [2] It is also referred to as the RC model or sometimes the FK representation after its founders Cees Fortuin and Piet Kasteleyn. The random cluster model has a critical limit, described by a conformal field theory.
Definition
Let
be a
graph, and
be a
bond configuration on the graph that maps each edge to a value of either 0 or 1. We say that a bond is
closed on edge
if
, and
open if
. If we let
A(\omega)=\{e\inE:\omega(e)=1\}
be the set of open bonds, then an
open cluster or
FK cluster is any connected component in
union the set of vertices. Note that an open cluster can be a single vertex (if that vertex is not
incident to any open bonds).
Suppose an edge is open independently with probability
and closed otherwise, then this is just the standard Bernoulli percolation process. The
probability measure of a configuration
is given as
\mu(\omega)=\prodep\omega(e)(1-p)1-\omega(e).
The RC model is a generalization of percolation, where each cluster is weighted by a factor of
. Given a configuration
, we let
be the number of open clusters, or alternatively the number of
connected components formed by the open bonds. Then for any
, the probability measure of a configuration
is given as
\mu(\omega)=
qC(\omega)\prodep\omega(e)(1-p)1-\omega(e).
Z is the partition function, or the sum over the unnormalized weights of all configurations,
Z=\sum\omega\left\{qC(\omega)\prodep\omega(e)(1-p)1-\omega(e)\right\}.
The partition function of the RC model is a specialization of the Tutte polynomial, which itself is a specialization of the multivariate Tutte polynomial.[3]
Special values of q
The parameter
of the random cluster model can take arbitrary complex values. This includes the following special cases:
:
linear resistance networks.
: negatively-correlated percolation.
: Bernoulli
percolation, with
.
: the
Ising model.
:
-state
Potts model.
Edwards-Sokal representation
The Edwards-Sokal (ES) representation[4] of the Potts model is named after Robert G. Edwards and Alan D. Sokal. It provides a unified representation of the Potts and random cluster models in terms of a joint distribution of spin and bond configurations.
Let
be a graph, with the number of vertices being
and the number of edges being
. We denote a spin configuration as
and a bond configuration as
. The joint measure of
is given as
\mu(\sigma,\omega)=Z-1\psi(\sigma)\phip(\omega)1A(\sigma,\omega),
where
is the uniform measure,
is the product measure with density
, and
is an appropriate normalizing constant. Importantly, the indicator function
of the set
A=\{(\sigma,\omega):\sigmai=\sigmajforanyedge(i,j)where\omega=1\}
enforces the constraint that a bond can only be open on an edge if the adjacent spins are of the same state, also known as the
SW rule.
The statistics of the Potts spins can be recovered from the cluster statistics (and vice versa), thanks to the following features of the ES representation:
of the spins is the
Boltzmann measure of the
q-state Potts model at inverse temperature
.
of the bonds is the random-cluster measure with parameters
q and
p.
of the spin represents a uniformly random assignment of spin states that are constant on each connected component of the bond arrangement
.
of the bonds represents a percolation process (of ratio
p) on the subgraph of
formed by the edges where adjacent spins are aligned.
- In the case of the Ising model, the probability that two vertices
are in the same connected component of the bond arrangement
equals the
two-point correlation function of spins
,
[5] written
\phip,q(i\leftrightarrowj)=\langle\sigmai\sigmaj\rangle
.
Frustration
There are several complications of the ES representation once frustration is present in the spin model (e.g. the Ising model with both ferromagnetic and anti-ferromagnetic couplings in the same lattice). In particular, there is no longer a correspondence between the spin statistics and the cluster statistics,[6] and the correlation length of the RC model will be greater than the correlation length of the spin model. This is the reason behind the inefficiency of the SW algorithm for simulating frustrated systems.
Two-dimensional case
If the underlying graph
is a
planar graph, there is a duality between the random cluster models on
and on the
dual graph
. At the level of the partition function, the duality reads
\tilde{Z}G(q,v)=q|V|-|E|-1v|E|
\left(q,
\right) with v=
and \tilde{Z}G(q,v)=(1-p)-|E|ZG(q,v)
On a self-dual graph such as the
square lattice, a
phase transition can only occur at the self-dual coupling
.
[7] The random cluster model on a planar graph can be reformulated as a loop model on the corresponding medial graph. For a configuration
of the random cluster model, the corresponding loop configuration is the set of self-avoiding loops that separate the clusters from the dual clusters. In the
transfer matrix approach, the loop model is written in terms of a
Temperley-Lieb algebra with the parameter
. In two dimensions, the random cluster model is therefore closely related to the
O(n) model, which is also a loop model.
In two dimensions, the critical random cluster model is described by a conformal field theory with the central charge
c=13-6\beta2-6\beta-2 with q=4\cos2(\pi\beta2) .
Known exact results include the conformal dimensions of the fields that detect whether a point belongs to an FK cluster or a spin cluster. In terms of Kac indices, these conformal dimensions are respectively
and
, corresponding to the
fractal dimensions
and
of the clusters.
History and applications
RC models were introduced in 1969 by Fortuin and Kasteleyn, mainly to solve combinatorial problems.[8] [5] After their founders, it is sometimes referred to as FK models. In 1971 they used it to obtain the FKG inequality. Post 1987, interest in the model and applications in statistical physics reignited. It became the inspiration for the Swendsen–Wang algorithm describing the time-evolution of Potts models.[9] Michael Aizenman and coauthors used it to study the phase boundaries in 1D Ising and Potts models.[10]
See also
External links
Notes and References
- On the random-cluster model: I. Introduction and relation to other models. Physica. 57. 4. 536. Fortuin. Kasteleyn. 10.1016/0031-8914(72)90045-6. 1972Phy....57..536F. 1972.
- Random cluster models. Grimmett. math/0205237. 2002.
- Book: Sokal, Alan. Surveys in Combinatorics 2005. The multivariate Tutte polynomial (Alias Potts model) for graphs and matroids. 2005. 173–226. 10.1017/CBO9780511734885.009. math/0503607. 9780521615235. 17904893.
- Edwards. Robert G.. Sokal. Alan D.. 1988-09-15. Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. Physical Review D. 38. 6. 2009–2012. 10.1103/PhysRevD.38.2009. 9959355. 1988PhRvD..38.2009E.
- Kasteleyn. P. W.. Fortuin. C. M.. 1969. Phase Transitions in Lattice Systems with Random Local Properties. Physical Society of Japan Journal Supplement . 26. 11. 1969JPSJS..26...11K .
- Cataudella. V.. Franzese. G.. Nicodemi. M.. Scala. A.. Coniglio. A.. 1994-03-07. Critical clusters and efficient dynamics for frustrated spin models. Physical Review Letters. 72. 10. 1541–1544. 10.1103/PhysRevLett.72.1541. 10055635. 1994PhRvL..72.1541C. 2445/13250. free.
- Beffara . Vincent . Duminil-Copin . Hugo . 2013-11-27 . The self-dual point of the two-dimensional random-cluster model is critical for $q\geq 1$ . math.PR . 1006.5073 .
- Book: Grimmett. The random cluster model.
- Swendsen. Robert H.. Wang. Jian-Sheng. 1987-01-12. Nonuniversal critical dynamics in Monte Carlo simulations. Physical Review Letters. 58. 2. 86–88. 10.1103/PhysRevLett.58.86. 10034599. 1987PhRvL..58...86S.
- Aizenman. M.. Chayes. J. T.. Chayes. L.. Newman. C. M.. April 1987. The phase boundary in dilute and random Ising and Potts ferromagnets. Journal of Physics A: Mathematical and General. 20. 5. L313–L318. 10.1088/0305-4470/20/5/010. 0305-4470. 1987JPhA...20L.313A.