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

page 1

page 2

page 3

page 4

research
12/21/2018

Bootstrap percolation on the stochastic block model

We analyze the bootstrap percolation process on the stochastic block mod...
research
03/30/2020

Sharp Concentration Results for Heavy-Tailed Distributions

We obtain concentration and large deviation for the sums of independent ...
research
04/08/2021

Large Deviations and Information theory for Sub-Critical SINR Randon Network Models

The article obtains large deviation asymptotic for sub-critical communic...
research
11/15/2019

A Bootstrap-based Inference Framework for Testing Similarity of Paired Networks

We live in an interconnected world where network valued data arises in m...
research
02/24/2021

Asymptotic results for linear combinations of spacings generated by i.i.d. exponential random variables

We prove large (and moderate) deviations for a class of linear combinati...
research
07/31/2020

Slightly Conservative Bootstrap for Maxima of Sums

We study the bootstrap for the maxima of the sums of independent random ...
research
09/28/2018

Large deviations for conditional guesswork

The guesswork problem was originally studied by Massey to quantify the n...

Please sign up or login with your details

Forgot password? Click here to reset