Frozen percolation on the binary tree was introduced by Aldous , inspired by sol-gel transitions. We investigate a version of the model on the triangular lattice, where connected components stop growing (freeze) as soon as they contain at least N vertices, where N is a (typically large) parameter. For the process in certain +nite domains, we show a Òseparation of scalesÓ and use this to prove a deconcentration property. Then, for the full-plane process, we prove an accurate comparison to the process in suitable +nite domains, and obtain that, with high probability (as N→), the origin belongs in the nal con+guration to a mesoscopic cluster, i.e., a cluster which contains many, but much fewer than N, vertices (and hence is non-frozen). For this work we develop new interesting properties for near-critical percolation, including asymp-totic formulas involving the percolation probability θ(p) and the characteristic length L(p) as p → pc.
|Number of pages||68|
|Journal||Annales Scientifiques de l'Ecole Normale Superieure|
|Publication status||Published - 1 Jul 2018|