Generating functions for message-passing on weighted networks: directed bond percolation and SIR epidemics

Abstract

We study the SIR ("susceptible, infected, removed/recovered") model on directed graphs with heterogeneous transmission probabilities within the message-passing approximation. We characterize the percolation transition, predict cluster size distributions and suggest vaccination strategies. All predictions are compared to numerical simulations on real networks. The percolation threshold which we predict is a rigorous lower bound to the threshold on real networks. For large, locally tree-like networks, our predictions agree very well with the numerical data.

References in corpus (14)

• Critical phenomena in complex networks
• Random graphs with clustering
• A message passing approach for general epidemic models
• Percolation on sparse networks
• Random graphs containing arbitrary distributions of subgraphs
• Predicting the size and probability of epidemics in a population with heterogeneous infectiousness and susceptibility
• Epidemic spreading on complex networks with general degree and weight distributions
• Percolation on correlated networks
• Mapping the Structure of Directed Networks: Beyond the "Bow-tie" Diagram
• Message-passing theory for cooperative epidemics
• Giant components in directed multiplex networks
• Random graphs with arbitrary clustering and their applications
• Two-pathogen model with competition on clustered networks
• Degree dependent transmission rates in epidemic processes