A Particular Bit of Universality: Scaling Limits of Some Dependent Percolation Models
Federico Camia, Charles M. Newman, Vladas Sidoravicius
Abstract
We study families of dependent site percolation models on the triangular lattice T and hexagonal lattice H that arise by applying certain cellular automata to independent percolation configurations. We analyze the scaling limit of such models and show that the distance between macroscopic portions of cluster boundaries of any two percolation models within one of our families goes to zero almost surely in the scaling limit. It follows that each of these cellular automaton generated dependent percolation models has the same scaling limit (in the sense of Aizenman-Burchard [3]) as independent site percolation on T.
Create a lesson
Related papers
Sublinear multi-type preferential attachment
Anna Ben-Hamou, Nicolas Broutin, Camille Cazaux
Uniform Central Limit Theorems for Degree Distributions of Sparse Graphon Models
Robert Lunde, Soumendra Lahiri
Matching Random Point Sets with Minimum Distortion
Itai Benjamini, Mark Braverman, Elad Tzalik et al.
Uniqueness and full coverage in k-neighbor graphs
David Coupier, Benoît Henry, Benedikt Jahnel et al.
Bass martingales need not stretch
Mathias Beiglböck, Manuel Hasenbichler, Gudmund Pammer
Universality of smallest singular values of random row submatrices and phase retrieval problems
Shu Wen, Christian E. Häggblom, Xiufan Yang