Upper bounds on the running time of bootstrap percolation

Weichan Liu, Xiangxiang Nie, Simón Piga +1

For $k$-graphs $F$ and $H_0$ the $F$-bootstrap percolation process (or $F$-process) starting with $H_0$ is a sequence $(H_i{)}_{i\ge 0}$ of $k$-graphs such that $H_{i+1}$ is obtained…