Bootstrap Percolation and Galton-Watson Trees (Keynote Speakers)

Author Karen Gunderson

Thumbnail PDF


  • Filesize: 217 kB
  • 1 pages

Document Identifiers

Author Details

Karen Gunderson
  • University of Manitoba, 186 Dysart Road, Winnipeg MB R3T 2N2, Canada

Cite AsGet BibTex

Karen Gunderson. Bootstrap Percolation and Galton-Watson Trees (Keynote Speakers). In 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 110, p. 4:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


A bootstrap process is a type of cellular automaton, acting on the vertices of a graph which are in one of two states: `healthy' or `infected'. For any positive integer r, the r-neighbour bootstrap process is the following update rule for the states of vertices: infected vertices remain infected forever and each healthy vertex with at least r infected neighbours becomes itself infected. These updates occur simultaneously and are repeated at discrete time intervals. Percolation is said to occur if all vertices are eventually infected. For an infinite graph, of interest is the random setting, in which each vertex is initially infected independently with a fixed probability. I will give some history of this process for infinite trees and present results on the possible values of critical probabilities for percolation on Galton-Watson trees. This talk is based on joint work with Bollobás, Holmgren, Janson, and Przykucki.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Random graphs
  • Mathematics of computing → Trees
  • bootstrap percolation
  • Galton-Watson trees


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail