The random-cluster model on the complete graph

DOI10.1007/BF01213683zbMath0846.05075MaRDI QIDQ1912568

Svante Janson, Geoffrey R. Grimmett, Béla Bollobás

Publication date: 29 September 1996

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

zbMATH Keywords

colouringprobability distributionrandom graphcomplete graphrandom-cluster modelgiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items

Size of the largest cluster under zero-range invariant measures, The critical mean-field Chayes–Machta dynamics, Large deviation analysis for layered percolation problems on the complete graph, The free energy in a class of quantum spin systems and interchange processes, Random cluster dynamics for the Ising model is rapidly mixing, The random-cluster model on a homogeneous tree, Faster mixing and small bottlenecks, Limit theorems and coexistence probabilities for the Curie-Weiss Potts model with an external field, Exponentially slow mixing in the mean-field Swendsen-Wang dynamics, New critical exponent inequalities for percolation and the random cluster model, Continuity of the Ising phase transition on nonamenable groups, The discontinuity of the specific heat for the 5D Ising model, Phase transition in the spanning-hyperforest model on complete hypergraphs, Swendsen‐Wang algorithm on the mean‐field Potts model, The Potts model and the Tutte polynomial, Glauber dynamics for the mean-field Potts model, Branching processes, and random-cluster measures on trees, Stochastic processes in random graphs, Phase transition for the interchange and quantum Heisenberg models on the Hamming graph, Random-cluster dynamics on random regular graphs in tree uniqueness, Power-law bounds for critical long-range percolation below the upper-critical dimension, The random cluster model on the complete graph via large deviations, Unnamed Item, Entropy for translation-invariant random-cluster measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotics of the number of forests consisting of unrooted trees
• Polymer models and generalized Potts-Kasteleyn models
• The Evolution of Random Graphs
• Poisson convergence and random graphs
• On tree census and the giant component in sparse random graphs
• Multicyclic components in a random graph process
• The Structure of a Random Graph at the Point of the Phase Transition
• The birth of the giant component
• BEHAVIOR IN LARGE DIMENSIONS OF THE POTTS AND HEISENBERG MODELS