Three‐Dimensional 2‐Critical Bootstrap Percolation: The Stable Sets Approach
Random Structures & Algorithms · 2026-07 · 68 (4)
DOI: 10.1002/rsa.70083 ↗Kurz gefasst
Fachartikel in der Zeitschrift Random Structures & Algorithms, online erschienen am 23.07.2026. Verfasst von Daniel Blanquicett. Die Arbeit nennt 21 Literaturangaben.
Abstract (Originalsprache)
Consider a ‐random subset of initially infected vertices in the discrete cube , and assume that the neighborhood of each vertex consists of the nearest neighbors in the ‐directions for each , where . Suppose we infect any healthy vertex already having infected neighbors, and that infected sites remain infected forever. In this article, we determine of the critical length for percolation up to a constant factor, for all with . We moreover give upper bounds for all remaining cases and believe that they are tight up to a constant factor.
Zitieren
APA
Blanquicett, D. (2026). Three‐Dimensional 2‐Critical Bootstrap Percolation: The Stable Sets Approach. Random Structures & Algorithms, 68(4). https://doi.org/10.1002/rsa.70083
Vancouver
Blanquicett D. Three‐Dimensional 2‐Critical Bootstrap Percolation: The Stable Sets Approach. Random Structures & Algorithms. 2026;68(4). doi:10.1002/rsa.70083
BibTeX
@article{Blanquicett2026,
author = {Blanquicett, Daniel},
title = {Three‐Dimensional 2‐Critical Bootstrap Percolation: The Stable Sets Approach},
journal = {Random Structures & Algorithms},
year = {2026},
volume = {68},
number = {4},
doi = {10.1002/rsa.70083}
}
EUVIMED