Identifying influential spreaders in complex networks based on gravity formula
From MaRDI portal
Abstract: How to identify the influential spreaders in social networks is crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases and rumors, and so on. In this paper, by viewing the k-shell value of each node as its mass and the shortest path distance between two nodes as their distance, then inspired by the idea of the gravity formula, we propose a gravity centrality index to identify the influential spreaders in complex networks. The comparison between the gravity centrality index and some well-known centralities, such as degree centrality, betweenness centrality, closeness centrality, and k-shell centrality, and so forth, indicates that our method can effectively identify the influential spreaders in real networks as well as synthetic networks. We also use the classical Susceptible-Infected-Recovered (SIR) epidemic model to verify the good performance of our method.
Recommendations
- A generalized gravity model for influential spreaders identification in complex networks
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Identifying influential spreaders by weight degree centrality in complex networks
- Spreading dynamics in complex networks
- Identification of influential nodes in complex networks: method from spreading probability viewpoint
Cites work
- A Computer Method for Calculating Kendall's Tau with Ungrouped Data
- A \(k\)-shell decomposition method for weighted networks
- Collective dynamics of `small-world' networks
- Emergence of Scaling in Random Networks
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Identifying influential spreaders by weighted leaderrank
- Identifying the node spreading influence with largest \(k\)-core values
- Predicting missing links via local information
- Spreading dynamics in complex networks
- The centrality index of a graph
Cited in
(24)- New trends in influence maximization models
- M-centrality: identifying key nodes based on global position and local degree variation
- GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks
- Quasi-Laplacian centrality: a new vertex centrality measurement based on quasi-Laplacian energy of networks
- Density centrality: identifying influential nodes based on area density formula
- Identification of influential nodes in complex networks: method from spreading probability viewpoint
- A new evidential methodology of identifying influential nodes in complex networks
- Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths
- Epidemic behaviors in weighted networks with core-periphery structure
- A generalized gravity model for influential spreaders identification in complex networks
- Identifying influential spreaders in artificial complex networks
- Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition
- Energy disruptive centrality with an application to criminal network
- Identifying multiple influential spreaders by a heuristic clustering algorithm
- Identifying influential spreaders in complex networks based on improved k-shell method
- Identifying influential nodes in complex networks based on network embedding and local structure entropy
- An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks
- Identifying influential spreaders in complex networks through local effective spreading paths
- CPR-TOPSIS: a novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy
- IDENTIFYING VITAL NODES IN COMPLEX NETWORK BY CONSIDERING MULTIPLEX INFLUENCES
- Maximizing influence in social networks by distinguishing the roles of seeds
- Identification of influential spreaders based on classified neighbors in real-world complex networks
- Identifying influential spreaders by weight degree centrality in complex networks
- Spreading dynamics in complex networks
This page was built for publication: Identifying influential spreaders in complex networks based on gravity formula
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1619389)