Identifying Influential Spreaders by Weighted LeaderRank
Authors:
- Linyuan LvLLLinyuan Lv
Preprint
Abstract
Identifying influential spreaders is crucial for understanding and controlling spreading processes on social networks. Via assigning degree-dependent weights onto links associated with the ground node, we proposed a variant to a recent ranking algorithm named LeaderRank [L. Lv et al., PLoS ONE 6 (2011) e21202]. According to the simulations on the standard SIR model, the weighted LeaderRank performs better than LeaderRank in three aspects: (i) the ability to find out more influential spreaders, (ii) the higher tolerance to noisy data, and (iii) the higher robustness to intentional attacks.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- Ranking the spreading influence in complex networksPhysica A: Statistical Mechanics and its Applications, 2013
- Global efficiency of local immunization on complex networksScientific Reports, 2013
- Ranking spreaders by decomposing complex networksPhysics Letters A, 2013
- Identifying all-around nodes for spreading dynamics in complex networksPhysica A: Statistical Mechanics and its Applications, 2012
- Identifying influential nodes in complex networksPhysica A: Statistical Mechanics and its Applications, 2012
- Link prediction in complex networks: A surveyPhysica A: Statistical Mechanics and its Applications, 2011
- Identification of influential spreaders in complex networksNature Physics, 2010
- Immunization of susceptible–infected model on scale-free networksPhysica A: Statistical Mechanics and its Applications, 2007
- Some unique properties of eigenvector centralitySocial Networks, 2007
- The anatomy of a large-scale hypertextual Web search engineComputer Networks and ISDN Systems, 1998