Deterministic bootstrap percolation in high dimensional grids
Huang, Hao · Lee, Choongbum
Original · EN
In this paper, we study the k-neighbor bootstrap percolation process on the d-dimensional grid [n]ᵈ, and show that the minimum number of initial vertices that percolate is (1-d/k)nᵈ + O(nᵈ⁻¹) when d<=k<=2d. This confirms a conjecture of Pete.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.