Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T21:22:22.789Z Has data issue: false hasContentIssue false

Limit Theorems for the painting of graphs by clusters

Published online by Cambridge University Press:  15 August 2002

Olivier Garet*
Affiliation:
Laboratoire de Mathématiques, Applications et Physique Mathématique d'Orléans, UMR 6628, Université d'Orléans, BP. 6759, 45067 Orléans Cedex 2, France; Olivier.Garet@labomath.univ-orleans.fr.
Get access

Abstract

We consider a generalization of the so-called divide andcolor model recently introduced by Häggström. We investigate thebehavior of the magnetization in large boxes of the lattice $\mathbb{Z}^d$ and its fluctuations. Thus, Laws of Large Numbers and CentralLimit Theorems are proved, both quenched and annealed. We showthat the properties of the underlying percolation process deeplyinfluence the behavior of the coloring model. In the subcriticalcase, the limit magnetization is deterministic and the CentralLimit Theorem admits a Gaussian limit. Conversely, the limitmagnetization is not deterministic in the supercritical case andthe limit of the Central Limit Theorem is not Gaussian, except inthe particular model with exactly two colors which are equallyprobable. We also prove a Central Limit Theorem for the size of the intersection of the infinite cluster with large boxes in supercritical bond percolation.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable