A percolation process on the square lattice where large finite clusters are frozen

Details A percolation process on the square lattice where large finite clusters are frozen A percolation process on the square lattice where large finite clusters are frozen

2010-06-10

arxiv.org/abs/1006.2050v1

Mathematics

Probability

9 pages, 1 figure

Scientific paper

Aldous constructed a growth process for the binary tree where clusters freeze as soon as they become infinite. It was pointed out by Benjamini and Schramm that such a process does not exist for the square lattice. This motivated us to investigate the modified process on the square lattice, where clusters freeze as soon as they have diameter larger than or equal to N, the parameter of the model. The non-existence result, mentioned above, raises the question if the N-parameter model shows some 'anomalous' behaviour as N tends to infinity. For instance, if one looks at the cluster of a given vertex, does, as N tends to infinity, the probability that it eventually freezes go to 1? Does this probability go to 0? More generally, what can be said about the size of a final cluster? We give a partial answer to some of such questions.

Affiliated with

Also associated with

No associations

Rating

A percolation process on the square lattice where large finite clusters are frozen 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 A percolation process on the square lattice where large finite clusters are frozen, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A percolation process on the square lattice where large finite clusters are frozen will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492383