Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-07T00:39:47.452Z Has data issue: false hasContentIssue false

Bootstrap percolation in inhomogeneous random graphs

Published online by Cambridge University Press:  07 August 2023

Hamed Amini*
Affiliation:
University of Florida
Nikolaos Fountoulakis*
Affiliation:
University of Birmingham
Konstantinos Panagiotou*
Affiliation:
University of Munich
*
*Postal address: Department of Industrial and Systems Engineering, University of Florida, 468 Weil Hall, Gainesville, FL 32611, USA. Email address: aminil@ufl.edu
**Postal address: School of Mathematics, University of Birmingham, Birmingham B15 2TT, UK. Email address: n.fountoulakis@bham.ac.uk
***Postal address: Mathematical Institute, University of Munich, Theresienstr. 39, 80333 München, Germany. Email address: kpanagio@math.lmu.de
Rights & Permissions [Opens in a new window]

Abstract

A bootstrap percolation process on a graph with n vertices is an ‘infection’ process evolving in rounds. Let $r \ge 2$ be fixed. Initially, there is a subset of infected vertices. In each subsequent round, every uninfected vertex that has at least r infected neighbors becomes infected as well and remains so forever.

We consider this process in the case where the underlying graph is an inhomogeneous random graph whose kernel is of rank one. Assuming that initially every vertex is infected independently with probability $p \in (0,1]$, we provide a law of large numbers for the size of the set of vertices that are infected by the end of the process. Moreover, we investigate the case $p = p(n) = o(1)$, and we focus on the important case of inhomogeneous random graphs exhibiting a power-law degree distribution with exponent $\beta \in (2,3)$. The first two authors have shown in this setting the existence of a critical $p_c =o(1)$ such that, with high probability, if $p =o(p_c)$, then the process does not evolve at all, whereas if $p = \omega(p_c)$, then the final set of infected vertices has size $\Omega(n)$. In this work we determine the asymptotic fraction of vertices that will eventually be infected and show that it also satisfies a law of large numbers.

Information

Type
Original Article
Copyright
© The Author(s), 2023. Published by Cambridge University Press on behalf of Applied Probability Trust