A large deviation approach to super-critical bootstrap percolation on the random graph G_n,p

02/06/2018
by   Giovanni Luca Torrisi, et al.
0

We consider the Erdös--Rényi random graph G_n,p 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 A_n^* of active nodes, under a suitable super-critical regime. More specifically, we establish large deviation principles for the sequence of random variables {n- A_n^*/f(n)}_n≥ 1 with explicit rate functions and allowing the scaling function f to vary in the widest possible range.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro