27 research outputs found
Maximal Bootstrap Percolation Time on the Hypercube via Generalised Snake-in-the-Box
In -neighbour bootstrap percolation, vertices (sites) of a graph are
infected, round-by-round, if they have neighbours already infected. Once
infected, they remain infected. An initial set of infected sites is said to
percolate if every site is eventually infected. We determine the maximal
percolation time for -neighbour bootstrap percolation on the hypercube for
all as the dimension goes to infinity up to a logarithmic
factor. Surprisingly, it turns out to be , which is in great
contrast with the value for , which is quadratic in , as established by
Przykucki. Furthermore, we discover a link between this problem and a
generalisation of the well-known Snake-in-the-Box problem.Comment: 14 pages, 1 figure, submitte
Maximal induced paths and minimal percolating sets in hypercubes
For a graph , the \emph{-bootstrap percolation} process can be described as follows: Start with an initial set of "infected'' vertices. Infect any vertex with at least infected neighbours, and continue this process until no new vertices can be infected. is said to \emph{percolate in } if eventually all the vertices of are infected. is a \emph{minimal percolating set} in if percolates in and no proper subset of percolates in . An induced path, , in a hypercube is maximal if no induced path in properly contains . Induced paths in hypercubes are also called snakes. We study the relationship between maximal snakes and minimal percolating sets (under 2-bootstrap percolation) in hypercubes. In particular, we show that every maximal snake contains a minimal percolating set, and that every minimal percolating set is contained in a maximal snake