Deterministic bootstrap percolation in high dimensional grids
Abstract
In this paper, we study the k-neighbor bootstrap percolation process on the d-dimensional grid [n]d, and show that the minimum number of initial vertices that percolate is (1-d/k)nd + O(nd-1)$ when d<=k<=2d. This confirms a conjecture of Pete.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.