Time-dependent influence metric for cascade dynamics on networks
Authors:
Preprint
Abstract
An algorithm for efficiently calculating the expected size of single-seed cascade dynamics on networks is proposed and tested. The expected size is a time-dependent quantity and so enables the identification of nodes who are the most influential early or late in the spreading process. The measure is accurate for both critical and subcritical dynamic regimes and so generalises the nonbacktracking centrality that was previously shown to successfully identify the most influential single spreaders in a model of critical epidemics on networks.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Efficient collective influence maximization in cascading processes with first-order transitionsScientific Reports, 2017
- Fundamental difference between superblockers and superspreaders in networksPhysical Review E, 2017
- Collective Influence Algorithm to find influencers via optimal percolation in massively large social mediaScientific Reports, 2016
- Leveraging percolation theory to single out influential spreaders in networksPhysical Review E, 2016
- 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
- Message passing approach for general epidemic modelsPhysical Review E, 2010
- A Unified Framework for Numerically Inverting Laplace TransformsINFORMS Journal on Computing, 2006
- Multi‐precision Laplace transform inversionInternational Journal for Numerical Methods in Engineering, 2004