Limit theorems for the painting of graphs by clusters

Details Limit theorems for the painting of graphs by clusters Limit theorems for the painting of graphs by clusters

2001-03-05

arxiv.org/abs/math/0103027v1

Mathematics

Probability

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Limit theorems for the painting of graphs by clusters does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Limit theorems for the painting of graphs by clusters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limit theorems for the painting of graphs by clusters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-431518