Percolation and the random cluster model: Combinatorial and algorithmic problems

MaRDI QIDQ4226452zbMATH OpenFDO

Authors D. J. A. Welsh

Publication date 8 April 1999

zbMATH Keywords

Ising modelpartition functionpercolationTutte polynomial

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial probability (60C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Review text

This elegant and nicely written survey starts with a review of classical percolation theory and then discusses from a combinatorial point of view the Ising, Potts and random cluster models. The author surveys properties of the Tutte polynomial and highlights its relationship with the above-mentioned models. In particular, the author concerns with the difficulties involved in obtaining good approximation schemes for the partition function of the Ising and random cluster models. For the entire collection see [Zbl 0898.00019].

Recommendations

• The Potts and random-cluster models
• The Potts model and the Tutte polynomial.
• The random cluster process
• The Random-Cluster Model

Cited in

(8)

• \(k\)-nearest-neighbor clustering and percolation theory
• Computing the Tutte polynomial of Archimedean tilings
• scientific article; zbMATH DE number 15994 (Why is no real title available?)
• Exactly Solvable Hierarchical Optimization Problem Related to Percolation
• scientific article; zbMATH DE number 863506 (Why is no real title available?)
• CONCOMITANT CLUSTERS STRUCTURE CREATING BY HAMMERSLEY — LEATH — ALEXANDROWICHZ ALGORITHM FOR PERCOLATION CLUSTER GENERATING
• Tutte polynomials and random-cluster models in Bernoulli cell complexes
• Dominic Welsh: his work and influence

This page was built for publication: Percolation and the random cluster model: Combinatorial and algorithmic problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4226452)