01:39:42
publiée le 4 juillet 2025
Lecture 3: What is the Universal Scaling Limit of Random Interface Growth, and What Does It Tell Us?
De Ivan Corwin
Bootstrap percolation on Erdos-Renyi graphs
De Omer Angel
Apparaît dans la collection : Dynamics on random graphs and random maps / Dynamiques sur graphes et cartes aléatoires
We consider bootstrap percolation on the Erdos-Renyi graph: given an initial infected set, a vertex becomes infected if it has at least $r$ infected neighbours. The graph is susceptible if there exists an initial set of size $r$ that infects the whole graph. We identify the critical threshold for susceptibility. We also analyse Bollobas's related graph-bootstrap percolation model. Joint with Brett Kolesnik.
