Large Deviations for Subcritical Bootstrap Percolation on the Erdős–Rényi Graph
Keyword(s):
AbstractWe study atypical behavior in bootstrap percolation on the Erdős–Rényi random graph. Initially a set S is infected. Other vertices are infected once at least r of their neighbors become infected. Janson et al. (Ann Appl Probab 22(5):1989–2047, 2012) locates the critical size of S, above which it is likely that the infection will spread almost everywhere. Below this threshold, a central limit theorem is proved for the size of the eventually infected set. In this work, we calculate the rate function for the event that a small set S eventually infects an unexpected number of vertices, and identify the least-cost trajectory realizing such a large deviation.
2019 ◽
Vol 21
(01)
◽
pp. 1750092
◽
1998 ◽
Vol 76
(1)
◽
pp. 61-75
◽
Keyword(s):
1996 ◽
Vol 28
(04)
◽
pp. 1051-1071
◽
1988 ◽
Vol 104
(3)
◽
pp. 561-574
◽
2002 ◽
Vol 39
(04)
◽
pp. 829-838
◽
1991 ◽
Vol 4
(4)
◽
pp. 575-588
◽
Keyword(s):
2019 ◽
Vol 09
(02)
◽
pp. 2050001
1983 ◽
Vol 27
(2)
◽
pp. 324-337
◽
Keyword(s):