Bootstrap percolation on Erdos-Renyi graphs | Vidéo | Carmin.tv

00:00:00 / 00:00:00

Chapters

Bootstrap percolation on Erdos-Renyi graphs

Appears in 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.

Information about the video

Date of recording 25/10/2017
Date of publication 26/10/2017
Institution CIRM
Licence CC BY NC ND
Language English
Director(s) Guillaume Hennenfent
Format MP4

Citation data

DOI 10.24350/CIRM.V.19230003
Cite this video Angel, Omer (25/10/2017). Bootstrap percolation on Erdos-Renyi graphs. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19230003
URL https://dx.doi.org/10.24350/CIRM.V.19230003

Domain(s)

Bibliography

Angel, O., & Kolesnik, B. (2016). Thresholds for contagious sets in random graphs. <arXiv:1611.10167> - https://arxiv.org/abs/1611.10167

MSC codes

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow

Copyright Carmin.tv 2026

Give feedback