Understanding the spreading power of all nodes in a network: a continuous-time perspective
arXiv:1405.6707 · doi:10.1038/srep08665
Abstract
Centrality measures such as the degree, k-shell, or eigenvalue centrality can identify a network's most influential nodes, but are rarely usefully accurate in quantifying the spreading power of the vast majority of nodes which are not highly influential. The spreading power of all network nodes is better explained by considering, from a continuous-time epidemiological perspective, the distribution of the force of infection each node generates. The resulting metric, the \textit{expected force}, accurately quantifies node spreading power under all primary epidemiological models across a wide range of archetypical human contact networks. When node power is low, influence is a function of neighbor degree. As power increases, a node's own degree becomes more important. The strength of this relationship is modulated by network structure, being more pronounced in narrow, dense networks typical of social networking and weakening in broader, looser association networks such as the Internet. The expected force can be computed independently for individual nodes, making it applicable for networks whose adjacency matrix is dynamic, not well specified, or overwhelmingly large.
References in corpus (18)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The diameter of the world wide web
- The spread of epidemic disease on networks
- Identification of influential spreaders in complex networks
- The Dynamics of Viral Marketing
- The large deviation approach to statistical mechanics
- Self-similar community structure in organisations
- Subgraph Centrality in Complex Networks
- Global organization of metabolic fluxes in the bacterium, Escherichia coli
- Networks and the Epidemiology of Infectious Disease
- A measure of individual role in collective dynamics
- Identifying influential spreaders and efficiently estimating infection numbers in epidemic models: a walk counting approach
- Epidemic centrality - is there an underestimated epidemic impact of network peripheral nodes?
- How Many Nodes are Effectively Accessed in Complex Networks?
- Predicting epidemic outbreak from individual features of the spreaders
- An Exact Relationship Between Invasion Probability and Endemic Prevalence for Markovian SIS Dynamics on Networks
- PageRank and rank-reversal dependence on the damping factor
Cited by in corpus (22)
- Identify influential spreaders in complex networks, the role of neighborhood
- Predictive Analysis on Twitter: Techniques and Applications
- Leveraging local h-index to identify and rank influential spreaders in networks
- Efficient collective influence maximization in cascading processes with first-order transitions
- Centrality measure based on continuous-time quantum walks and experimental realization
- Accurate ranking of influential spreaders in networks based on dynamically asymmetric link-impact
- Stochasticity in pandemic spread over the World Airline Network explained by local flight connections
- Influencers identification in complex networks through reaction-diffusion dynamics
- Quantum centrality testing on directed graphs via PT-symmetric quantum walks
- Modelling indirect interactions during failure spreading in a project activity network
- Inward and Outward Network Influence Analysis
- Imputations for High Missing Rate Data in Covariates via Semi-supervised Learning Approach
- Rank the spreading influence of nodes using dynamic Markov process
- Understanding and forecasting lifecycle events in information cascades
- StylePredict: Machine Theory of Mind for Human Driver Behavior From Trajectories
- A perturbation-based approach to identifying potentially superfluous network constituents
- Predicting Nodal Influence via Local Iterative Metrics
- A Comparison of Spatial-based Targeted Disease Containment Strategies using Mobile Phone Data
- Using Gossips to Spread Information: Theory and Evidence from a Randomized Controlled Trial
- Aggregate-networks and p-cores of monoflow partially overlapped multilayer systems
- Calibratable Hetero-NodeRank for measuring node influence
- Measuring the influence of beliefs in belief networks