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

From MaRDI portal
Publication:2000133

DOI10.1016/J.SPA.2018.06.006zbMATH Open1415.60120arXiv1802.01847OpenAlexW2963241967MaRDI QIDQ2000133FDOQ2000133


Authors: Giovanni Luca Torrisi, M. Garetto, Emilio Leonardi Edit this on Wikidata


Publication date: 28 June 2019

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Abstract: We consider the Erd"{o}s--R'{e}nyi random graph Gn,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 An of active nodes, under a suitable super-critical regime. More specifically, we establish large deviation principles for the sequence of random variables fracnAnf(n)ngeq1 with explicit rate functions and allowing the scaling function f to vary in the widest possible range.


Full work available at URL: https://arxiv.org/abs/1802.01847




Recommendations




Cites Work


Cited In (3)





This page was built for publication: A large deviation approach to super-critical bootstrap percolation on the random graph \(G_{n, p}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000133)