A percolation process on the square lattice where large finite clusters are frozen
Abstract
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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.