Contagious sets in a degree-proportional bootstrap percolation process

TL;DR

This paper investigates the minimum size of initial infected sets needed to infect an entire connected graph under a degree-proportional bootstrap percolation process, establishing tight bounds and improvements over prior work.

Contribution

It proves a sharp upper bound on the size of contagious sets in degree-proportional bootstrap percolation, refining previous bounds and providing optimal results for graphs with girth at least five.

Findings

Every connected graph on n vertices has a contagious set of size less than 2ρn or size 1.

The bound is tight and improves previous results by Chang, Lyuu, Gentner, and Rautenbach.

A stronger bound is established for graphs with girth at least five and small ρ, which is asymptotically optimal.

Abstract

We study the following bootstrap percolation process: given a connected graph $G$, a constant $\rho \in [0, 1]$ and an initial set $A \subseteq V(G)$ of \emph{infected} vertices, at each step a vertex~$v$ becomes infected if at least a $\rho$-proportion of its neighbours are already infected (once infected, a vertex remains infected forever). Our focus is on the size $h_\rho(G)$ of a smallest initial set which is \emph{contagious}, meaning that this process results in the infection of every vertex of $G$. Our main result states that every connected graph $G$ on $n$ vertices has $h_\rho(G) < 2\rho n$ or $h_\rho(G) = 1$ (note that allowing the latter possibility is necessary because of the case $\rho\leq\tfrac{1}{2n}$, as every contagious set has size at least one). This is the best-possible bound of this form, and improves on previous results of Chang and Lyuu and of Gentner and Rautenbach. We also provide a stronger bound for graphs of girth at least five and sufficiently small $\rho$, which is asymptotically best-possible.