Abstract
An algorithm for efficiently calculating the expected size of single-seed cascade dynamics on networks is proposed and tested. The expected cascade size is a time-dependent quantity and so enables the identification of nodes that are the most influential early or late in the spreading process. The measure is accurate for both critical and subcritical dynamic regimes and so generalizes the nonbacktracking centrality that was previously shown to successfully identify the most influential single spreaders in a model of critical epidemics on networks.
| Original language | English |
|---|---|
| Article number | 054310 |
| Pages (from-to) | 1-11 |
| Number of pages | 11 |
| Journal | Physical Review E |
| Volume | 111 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - May 2025 |
| MoE publication type | A1 Journal article-refereed |