Assessing node risk and vulnerability in epidemics on networks

Abstract

Which nodes are most vulnerable to an epidemic spreading through a network, and which carry the highest risk of causing a major outbreak if they are the source of the infection? Here we show how these questions can be answered to good approximation using the cavity method. Several curious properties of node vulnerability and risk are explored: some nodes are more vulnerable than others to weaker infections, yet less vulnerable to stronger ones; a node is always more likely to be caught in an outbreak than it is to start one, except when the disease has a deterministic lifetime; the rank order of node risk depends on the details of the distribution of infectious periods.

Note that Figure 2 does not appear in the final published version

References in corpus (6)

• A message passing approach for general epidemic models
• Percolation on sparse networks
• Cavity Approach to the Spectral Density of Sparse Symmetric Random Matrices
• Cavity approach to the spectral density of non-Hermitian sparse matrices
• Tight lower bound for percolation threshold on a quasi-regular graph
• Maximum-entropy moment-closure for stochastic systems on networks