| Friday 19 April 2024 | |
| Events for day: Wednesday 17 August 2022 |
| 14:00 - 15:00 Combinatorics and Computing Weekly Seminar The R-neighbor Bootstrap Percolation Process on Graphs School MATHEMATICS The r-neighbor bootstrap percolation is the most studied version of bootstrap percolation processes on graphs. The process was introduced in 1979 by Chalupa, Leath, and Reich in Physics. In the r-neighbor bootstrap percolation process on a graph, first some vertices are initially activated and then, in each phase, any inactive vertex with at least r active neighbors becomes activated. Once a vertex becomes activated, it remains active forever. The process has also been treated in the literature under other names like irreversible threshold, influence propagation, and dynamic monopoly. In this talk, we survey some previous results about the r- ... |