Thresholds for contagious sets in random graphs
  For fixed $r\geq 2$, we consider bootstrap percolation with threshold $r$ on the Erd\H{o}s-R\'enyi graph ${\cal G}_{n,p}$. We identify a threshold for $p$ above which there is with high probability a set of size $r$ which can infect the entire graph. This improves a result of Feige, Krivelevich and Reichman, which gives bounds for this threshold, up to multiplicative constants.   As an application of our results, we also obtain an upper bound for the threshold for $K_4$-bootstrap percolation on ${\cal G}_{n,p}$, as studied by Balogh, Bollob\'as and Morris. We conjecture that our bound is asymptotically sharp.   These thresholds are closely related to the survival probabilities of certain time-varying branching processes, and we derive asymptotic formulae for these survival probabilities which are of interest in their own right. 
Omer Angel and Brett Kolesnik
math.PR math.CO