A large deviation approach to super-critical bootstrap percolation on the random graph
arXiv:1802.01847
Abstract
We consider the Erdös--Rényi random graph and we analyze the simple irreversible epidemic process on the graph, known in the literature as bootstrap percolation. We give a quantitative version of some results by Janson et al. (2012), providing a fine asymptotic analysis of the final size of active nodes, under a suitable super-critical regime. More specifically, we establish large deviation principles for the sequence of random variables with explicit rate functions and allowing the scaling function to vary in the widest possible range.
arXiv comment44 pages
References in corpus (6)
- Stochastic blockmodels and community structure in networks
- Bootstrap percolation on the random graph
- A message-passing approach for threshold models of behavior in networks
- Bootstrap percolation on a graph with random and local connections
- Large deviations for subcritical bootstrap percolation on the random graph
- Bootstrap percolation in random -uniform hypergraphs