Abstract

The random-cluster model is defined as a model for phase transitions and other phenomena in lattice systems, or more generally in systems with a graph structure. The model is characterized by a (probability) measure on a graph and a real parameter κ. By specifying the value of κ to 1, 2, 3, 4, … is shown that the model covers the percolation model, the Ising model, the Ashkin-Teller-Potts model with 3, 4, … states per atom, respectively, and thereby, contains information on graph-colouring problems; in the limit κ ↓ 0 it describes linear resistance networks. It is shown that the function which for the random-cluster model plays the role of a partition function, is a generalization of the dichromatic polynomial earlier introduced by Tutte, and related polynomials.

Links and resources

Tags