Time-dependent influence metric for cascade dynamics on networks
Open Access
- 19 May 2025
- journal article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (5) , 054310
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. Published by the American Physical Society 2025Keywords
All Related Versions
Funding Information
- Science Foundation Ireland (16/IA/4470, 12/RC/2289 P2)
This publication has 24 references indexed in Scilit:
- Message passing on networks with loopsProceedings of the National Academy of Sciences, 2019
- Temporal profiles of avalanches on networksNature Communications, 2017
- Efficient collective influence maximization in cascading processes with first-order transitionsScientific Reports, 2017
- Network dismantlingProceedings of the National Academy of Sciences, 2016
- Collective Influence Algorithm to find influencers via optimal percolation in massively large social mediaScientific Reports, 2016
- Influence maximization in complex networks through optimal percolationNature, 2015
- Competition among memes in a world with limited attentionScientific Reports, 2012
- The Dynamics of Protest Recruitment through an Online NetworkScientific Reports, 2011
- What's in a crowd? Analysis of face-to-face behavioral networksJournal of Theoretical Biology, 2011
- Multi‐precision Laplace transform inversionInternational Journal for Numerical Methods in Engineering, 2004