Live briefing
Everything about Random cluster model
Type of random graph
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. 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. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Random cluster modelA 5-minute orientation
- Skim a recent paper: Planar random-cluster model: scaling relationsInfluential work since 2022
- Pick up a classic book: Design and analysis of cluster randomization trials in health researchThe most-reprinted book on the subject
- Read the landmark paper: On the random-cluster modelCited 1,409 times
- Go sideways: Swendsen–Wang algorithmA closely related topic
- Go sideways: Potts modelA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
On the random-cluster model
On the random-cluster model II. The percolation model
The Random Cluster Model for Robust Geometric Fitting
On the random-cluster model
Random walk on the infinite cluster of the percolation model
The random-cluster model on the complete graph
The random-cluster model on a homogeneous tree
Explicit Isoperimetric Constants and Phase Transitions in the Random-Cluster Model
🆕 Influential since 2022
Planar random-cluster model: scaling relations
Modularity-based Hypergraph Clustering: Random Hypergraph Model, Hyperedge-cluster Relation, and Computation
Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs
Finitary codings for the random-cluster model and other infinite-range monotone models
Bimodal-random field Blume–Capel model in the cluster variation method
đź“š Books worth reading
Design and analysis of cluster randomization trials in health researchAllan Donner · 2000
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Swendsen–Wang algorithm The Swendsen–Wang algorithm is the first non-local or cluster algorithm for Monte Carlo simulation for large systems near criticality. It has been introduced…
- Potts model In statistical mechanics, the Potts model, a generalization of the Ising model, is a model of interacting spins on a crystalline lattice. By studying the…
- Lattice model (physics) In mathematical physics, a lattice model is a mathematical model of a physical system that is defined on a lattice, as opposed to a continuum, such as…
- Replica cluster move Replica cluster move in condensed matter physics refers to a family of non-local cluster algorithms used to simulate spin glasses. It is an extension of…
- Critical three-state Potts model The three-state Potts CFT, also known as the Z 3 {\displaystyle \mathbb {Z} _{3}} parafermion CFT, is a conformal field theory in two dimensions. It is…
- Monte Carlo method in statistical mechanics Monte Carlo in statistical physics refers to the application of the Monte Carlo method to problems in statistical physics, or statistical mechanics. The…
- Weierstrass elliptic function In mathematics, the Weierstrass elliptic functions are elliptic functions that take a particularly simple form. They are named for Karl Weierstrass. This…
- Dynamical mean-field theory Dynamical mean-field theory (DMFT) is a method to determine the electronic structure of strongly correlated materials. In such materials, the approximation…