Premium
A percolation process on the square lattice where large finite clusters are frozen
Author(s) -
van den Berg Jacob,
de Lima Bernardo N.B.,
Nolin Pierre
Publication year - 2012
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.20375
Subject(s) - square lattice , lattice (music) , statistical physics , mathematics , combinatorics , cluster (spacecraft) , vertex (graph theory) , square (algebra) , binary number , square root , percolation (cognitive psychology) , binary tree , discrete mathematics , physics , computer science , geometry , graph , arithmetic , programming language , neuroscience , acoustics , ising model , biology
In (Aldous, Math. Proc. Cambridge Philos. Soc. 128 (2000), 465–477), 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 → ∞ . For instance, if one looks at the cluster of a given vertex, does, as N → ∞ , 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. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012