Identifying influential spreaders in complex networks based on gravity formula
From MaRDI portal
Publication:1619389
DOI10.1016/j.physa.2015.12.162zbMath1400.92403arXiv1505.02476OpenAlexW2161953836MaRDI QIDQ1619389
Chuang Ma, Ling-ling Ma, Bing-Hong Wang, Hai-feng Zhang
Publication date: 13 November 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.02476
Related Items
Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths ⋮ Identification of influential nodes in complex networks: method from spreading probability viewpoint ⋮ New trends in influence maximization models ⋮ A generalized gravity model for influential spreaders identification in complex networks ⋮ Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition ⋮ Identifying influential spreaders in complex networks based on improved k-shell method ⋮ Quasi-Laplacian centrality: a new vertex centrality measurement based on quasi-Laplacian energy of networks ⋮ Epidemic behaviors in weighted networks with core-periphery structure ⋮ CPR-TOPSIS: a novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy ⋮ Maximizing influence in social networks by distinguishing the roles of seeds ⋮ Identifying multiple influential spreaders by a heuristic clustering algorithm ⋮ An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks ⋮ A new evidential methodology of identifying influential nodes in complex networks ⋮ Identification of influential spreaders based on classified neighbors in real-world complex networks ⋮ IDENTIFYING VITAL NODES IN COMPLEX NETWORK BY CONSIDERING MULTIPLEX INFLUENCES ⋮ M-Centrality: identifying key nodes based on global position and local degree variation ⋮ Density centrality: identifying influential nodes based on area density formula ⋮ Energy disruptive centrality with an application to criminal network
Cites Work
- Predicting missing links via local information
- Identifying the node spreading influence with largest \(k\)-core values
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Identifying influential spreaders by weighted leaderrank
- The centrality index of a graph
- Emergence of Scaling in Random Networks
- Spreading dynamics in complex networks
- Ak-shell decomposition method for weighted networks
- Collective dynamics of ‘small-world’ networks
- A Computer Method for Calculating Kendall's Tau with Ungrouped Data
