Bootstrap percolation on random trees

Shapira Assaf, MAP5, Université Paris Cité

Bootstrap percolation is a deterministic dynamics in discrete time defined on a graph. Each vertex of the graph is either infected or healthy, and at each time step healthy vertices become infected if it has sufficiently many infected neighbors. We will discuss the model on random trees, asking how the number infections grows with time.

Area: CS37 - Percolation (Matteo Quattropani)

Keywords: bootstrap percolation, metastability

Please Login in order to download this file