Probability Seminar: Brett Kolesnik
Topic
Thresholds for contagious sets in random graphs
Speakers
Details
Bootstrap percolation with threshold r on a graph G evolves as follows: initially some of its vertices are infected, and then any vertex with at least r infected neighbors becomes infected. On the Erdos–Renyi graph G(n,p) we identify the sharp threshold for p, above which there is with high probability a set of size r whose infection results in the infection of the entire graph. Joint work with Omer Angel.
Additional Information
Location: ESB 2012
Brett Kolesnik, UBC
Brett Kolesnik, UBC
This is a Past Event
Event Type
Scientific, Seminar
Date
February 8, 2017
Time
-
Location