Limit Theorems for the painting of graphs by clusters

DOI10.1051/PS:2001104zbMath0992.60090arXivmath/0103027OpenAlexW2074430258MaRDI QIDQ4534845

Olivier Garet

Publication date: 11 June 2002

Published in: ESAIM: Probability and Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0103027

zbMATH Keywords

percolationcentral limit theoremlaws of large numberscoloring model

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (5)

Generalized Divide and Color models ⋮ Rate function of large deviation for a class of nonhomogeneous Markov chains on supercritical percolation network ⋮ Gibbsianness and non-Gibbsianness in divide and color models ⋮ Asymptotic behaviors for percolation clusters with uncorrelated weights ⋮ Color representations of Ising models

Cites Work

• The correlation length for the high-density phase of Bernoulli perlocation
• The probability of a large cluster in supercritical Bernoulli perlocation
• Bernoulli percolation above threshold: An invasion percolation analysis
• Normal fluctuations and the FKG inequalities
• Positive correlations in the fuzzy Potts model
• Coloring percolation clusters at random.
• Infinite clusters in percolation models
• The Ising model on diluted graphs and strong amenability
• Percolation
• A martingale approach in the study of percolation clusters on the \(\mathbb{Z}^d\) lattice

This page was built for publication: Limit Theorems for the painting of graphs by clusters