Probability Seminar: Brett Kolesnik
- Date: 02/08/2017
- Time: 15:00
Lecturer(s):
Brett Kolesnik, UBC
Location:
University of British Columbia
Topic:
Thresholds for contagious sets in random graphs
Description:
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.
Other Information:
Location: ESB 2012