The role of centrality for the identification of influential spreaders in complex networks
Not on the map. Why?
Abstract (arXiv)
The identification of the most influential spreaders in networks is important to control and understand the spreading capabilities of the system as well as to ensure an efficient information diffusion such as in rumor-like dynamics. Recent works have suggested that the identification of influential spreaders is not independent of the dynamics being studied. For instance, the key disease spreaders might not necessarily be so when it comes to analyze social contagion or rumor propagation. Additionally, it has been shown that different metrics (degree, coreness, etc) might identify different influential nodes even for the same dynamical processes with diverse degree of accuracy. In this paper, we investigate how nine centrality measures correlate with the disease and rumor spreading capabilities of the nodes that made up different synthetic and real-world (both spatial and non-spatial) networks. We also propose a generalization of the random walk accessibility as a new centrality measure and derive analytical expressions for the latter measure for simple network configurations. Our results show that for non-spatial networks, the k-core and degree centralities are most correlated to epidemic spreading, whereas the average neighborhood degree, the closeness centrality and accessibility are most related to rumor dynamics. On the contrary, for spatial networks, the accessibility measure outperforms the rest of centrality metrics in almost all cases regardless of the kind of dynamics considered. Therefore, an important consequence of our analysis is that previous studies performed in synthetic random networks cannot be generalized to the case of spatial networks.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Apr 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 1; 2024: 1; 2025: 1.
6 papers.
- 2021Learning Sparse Graphs with a Core-periphery Structurecited by 1
- 2022Generative Models and Learning Algorithms for Core-Periphery Structured Graphscited by 1
- 2024Bayesian Optimization of Functions over Node Subsets in Graphscited by 1
- 2025Critical Nodes Identification in Complex Networks: A Surveycited by 1
- 2021Detecting Ideal Instagram Influencer Using Social Network Analysiscited by 0
- 2023Core-Intermediate-Peripheral Index: Factor Analysis of Neighborhood and Shortest Paths-based Centrality Metricscited by 0
- 2025Critical Nodes Identification in Complex Networks: A Survey8 Jul 2025
- 2024Bayesian Optimization of Functions over Node Subsets in Graphs24 May 2024
- 2023Core-Intermediate-Peripheral Index: Factor Analysis of Neighborhood and Shortest Paths-based Centrality Metrics10 Oct 2023
- 2022Generative Models and Learning Algorithms for Core-Periphery Structured Graphs4 Oct 2022
- 2021Learning Sparse Graphs with a Core-periphery Structure8 Oct 2021
- 2021Detecting Ideal Instagram Influencer Using Social Network Analysis12 Jul 2021