Limit Theorems for the painting of graphs by clusters

DOI10.1051/PS:2001104zbMATH Open0992.60090OpenAlexW2074430258MaRDI QIDQ4534845FDOQ4534845

Authors 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

central limit theorempercolationlaws of large numberscoloring model

Mathematics Subject Classification ID

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) Percolation (82B43)

Abstract: We consider a generalization of the so-called divide and color model recently introduced by Haggstrom. We investigate the behaviour of the magnetization in large boxes and its fluctuations. Thus, laws of large numbers and Central Limit theorems are proved, both quenched and annealed. We show that the properties of the underlying percolation process roughly influence the behaviour of the colorying model. In the subcritical case, the limit magnetization is deterministic and the Central Limit Theorem admits a Gaussian limit. A contrario, the limit magnetization is not deterministic in the supercritical case and the limit of the Central Limit Theorem is not Gaussian, except in the particular model with exactly two colors which are equally probable.

Recommendations

• Asymptotic behaviors for percolation clusters with uncorrelated weights
• Limit theorems for the size of the clusters of dependent percolation process on \(\mathbb Z^2\)
• Coloring percolation clusters at random.
• scientific article; zbMATH DE number 2248361
• Remarks on central limit theorems for the number of percolation clusters

Cites work

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

Cited in

(6)

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

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

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