Mihyun Kang, Tamás Makai
Published 2016-05-10Version 1
Bootstrap percolation on a graph with infection threshold $r\in \mathbb{N}$ is an infection process, which starts from a set of initially infected vertices and in each step every vertex with at least $r$ infected neighbours becomes infected. We consider bootstrap percolation on the binomial random graph $G(n,p)$, which was investigated among others by Janson, \L uczak, Turova and Valier (2012). We improve their results by strengthening the probability bounds for the number of infected vertices at the end of the process.
Comments: 12 pages, to appear in Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Poland, 4-8 July 2016
On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph
On $K_{2,t}$-bootstrap percolation
A simple proof of almost percolation on G(n;p)
![QR code for arXiv:1605.02995 [math.CO]](http://oss.arxitics.com/images/favicon.svg)