Dynamics on random graphs and random maps / Dynamiques sur graphes et cartes aléatoires

Collection Dynamics on random graphs and random maps / Dynamiques sur graphes et cartes aléatoires

Organizer(s) Ménard, Laurent ; Nolin, Pierre ; Schapira, Bruno ; Singh, Arvind
Date(s) 23/10/2017 - 27/10/2017
linked URL http://conferences.cirm-math.fr/1672.html
00:00:00 / 00:00:00
2 5

Bootstrap percolation on Erdos-Renyi graphs

By Omer Angel

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

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

Bibliography

Last related questions on MathOverflow

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

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback