title: Percolation on sparse networks.
abstract: We study percolation on networks, which is used as a model of the resilience of networked systems such as the Internet to attack or failure and as a simple model of the spread of disease over human contact networks. We reformulate percolation as a message passing process and demonstrate how the resulting equations can be used to calculate, among other things, the size of the percolating cluster and the average cluster size. The calculations are exact for sparse networks when the number of short loops in the network is small, but even on networks with many short loops we find them to be highly accurate when compared with direct numerical simulations. By considering the fixed points of the message passing process, we also show that the percolation threshold on a network with few loops is given by the inverse of the leading eigenvalue of the so-called nonbacktracking matrix.
authors.affiliation: Department of Physics, University of Michigan, Ann Arbor, Michigan 48109, USA.
authors.forename: Brian
authors.initials: B
authors.lastname: Karrer
authors.affiliation: Department of Physics, University of Michigan, Ann Arbor, Michigan 48109, USA.
authors.forename: M E J
authors.initials: ME
authors.lastname: Newman
authors.affiliation: Institut de Physique Théorique, CEA Saclay and URA 2306, CNRS, 91191 Gif-sur-Yvette, France.
authors.forename: Lenka
authors.initials: L
authors.lastname: Zdeborová