Polluted Bootstrap Percolation with Threshold Two in All Dimensions
Abstract
In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it has at least r occupied neighbors. On the cubic lattice Zd of dimension d>=3 with threshold r=2, we prove that the final density of occupied sites converges to 1 as p and q both approach 0, regardless of their relative scaling. Our result partially resolves a conjecture of Morris, and contrasts with the d=2 case, where Gravner and McDonald proved that the critical parameter is q/p2.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.