Abstract
We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least
We study this process on the binomial random graph
Citation
Uriel Feige. Michael Krivelevich. Daniel Reichman. "Contagious sets in random graphs." Ann. Appl. Probab. 27 (5) 2675 - 2697, October 2017. https://doi.org/10.1214/16-AAP1254
Information