First and second moments of the size distribution of bond percolation clusters on regular graphs

Abstract

Motivated by network resilience and insurance premiums in the context of cyber security, we derive universal upper bounds for the first and second moments of the size of bond percolation clusters on finite regular graphs. Thinking of the clusters as dynamical objects coupled with branching processes gives a first set of bounds that are accurate when the probability of an edge being open is small. Estimating the number of isolated vertices, we also obtain a second set of bounds that are accurate when the probability of an edge being closed is small. As an illustration, we apply our results to the first three Platonic solids.