Anisotropic bootstrap percolation in three dimensions

From MaRDI portal
Publication:2212604

DOI10.1214/20-AOP1434zbMATH Open1456.60250arXiv1908.11556OpenAlexW3089207841MaRDI QIDQ2212604FDOQ2212604


Authors: Daniel Blanquicett Edit this on Wikidata


Publication date: 24 November 2020

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: Consider a p-random subset A of initially infected vertices in the discrete cube [L]3, and assume that the neighbourhood of each vertex consists of the ai nearest neighbours in the pmei-directions for each iin1,2,3, where a1lea2lea3. Suppose we infect any healthy vertex xin[L]3 already having a3+1 infected neighbours, and that infected sites remain infected forever. In this paper we determine the critical length for percolation up to a constant factor in the exponent, for all triples (a1,a2,a3). To do so, we introduce a new algorithm called the beams process and prove an exponential decay property for a family of subcritical two-dimensional bootstrap processes.


Full work available at URL: https://arxiv.org/abs/1908.11556




Recommendations




Cites Work


Cited In (6)





This page was built for publication: Anisotropic bootstrap percolation in three dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2212604)