Deterministic bootstrap percolation in high dimensional grids
From MaRDI portal
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)n^d + O(n^{d-1})$ when d<=k<=2d. This confirms a conjecture of Pete.
This page was built for publication: Deterministic bootstrap percolation in high dimensional grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6244443)
