Bootstrap percolation on a generalized Hamming cube

Abstract

We consider the $r$-neighbor bootstrap percolation process on the graph with vertex set $V=\{0,1{\}}^n$ and edges connecting the pairs at Hamming distance $1,2,\dots ,k$, where $k\ge 2$. We find asymptotics of the critical probability of percolation for $r=2,3$. In the deterministic setting, we obtain several results for the size of the smallest percolating set for $k\ge 2$.