A centrality measure for quantifying spread on weighted, directed networks
Not on the map. Why?
Abstract (arXiv)
While many centrality measures for complex networks have been proposed, relatively few have been developed specifically for weighted, directed (WD) networks. Here we propose a centrality measure for spread (of information, pathogens, etc.) through WD networks based on the independent cascade model (ICM). While deriving exact results for the ICM requires Monte Carlo simulations, we show that our centrality measure (Viral Centrality) provides excellent approximation to ICM results for networks in which the weighted strength of cycles is not too large. We show this can be quantified with the leading eigenvalue of the weighted adjacency matrix, and we show that Viral Centrality outperforms other common centrality measures in both simulated and empirical WD networks.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Mar 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 5.
6 papers.
- 2025Improved Approximations for Hard Graph Problems using Predictionscited by 4
- 2025DynamiX: Large-Scale Dynamic Social Network Simulatorcited by 2
- 2025Algorithms for the preordering problem and their application to the task of jointly clustering and ordering the accounts of a social networkcited by 1
- 2025Critical Nodes Identification in Complex Networks: A Surveycited by 1
- 2025Learning Graph from Smooth Signals under Partial Observation: A Robustness Analysiscited by 1
- 2023Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functionscited by 0
- 2025Learning Graph from Smooth Signals under Partial Observation: A Robustness Analysis18 Sep 2025
- 2025DynamiX: Large-Scale Dynamic Social Network Simulator26 Jul 2025
- 2025Critical Nodes Identification in Complex Networks: A Survey8 Jul 2025
- 2025Improved Approximations for Hard Graph Problems using Predictions29 May 2025
- 2025Algorithms for the preordering problem and their application to the task of jointly clustering and ordering the accounts of a social network20 Feb 2025
- 2023Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions12 Dec 2023