Identifying a set of influential spreaders in complex networks

Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-r ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and k-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also proposed. However, these approaches suffer from a possibility that some spreaders are so close together that they overlap sphere of influence or time consuming. In this report, we present a simply yet effectively iterative method named VoteRank to identify a set of decentralized spreaders with the best spreading ability. In this approach, all nodes vote in a spreader in each turn, and the voting ability of neighbors of elected spreader will be decreased in subsequent turn. Experimental results on four real networks show that under Susceptible-Infected-Recovered (SIR) and Susceptible-Infected (SI) models, VoteRank outperforms the traditional benchmark methods on both spreading rate and final affected scale. What’s more, VoteRank has superior computational efficiency.

[1]  Chuang Liu,et al.  Information spreading on dynamic social networks , 2012, Commun. Nonlinear Sci. Numer. Simul..

[2]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[3]  An Zeng,et al.  Predicting the evolution of spreading on complex networks , 2014, Scientific Reports.

[4]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[5]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[6]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Hui Gao,et al.  Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering , 2013, PloS one.

[8]  Yong Deng,et al.  Weighted k-shell decomposition for complex networks based on potential edge weights , 2015 .

[9]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[10]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[11]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[12]  Zhong-Ke Gao,et al.  Multi-frequency complex network from time series for uncovering oil-water flow structure , 2015, Scientific Reports.

[13]  Ming Tang,et al.  Improving the accuracy of the k-shell method by removing redundant links: From a perspective of spreading dynamics , 2015, Scientific Reports.

[14]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[15]  Xiaokui Xiao,et al.  Influence maximization: near-optimal time complexity meets practical efficiency , 2014, SIGMOD Conference.

[16]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[17]  Zhiming Zheng,et al.  Searching for superspreaders of information in real-world social media , 2014, Scientific Reports.

[18]  Zhou Tao,et al.  Epidemic dynamics on complex networks , 2006 .

[19]  Giulio Cimini,et al.  Enhancing topology adaptation in information-sharing social networks. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Qi He,et al.  TwitterRank: finding topic-sensitive influential twitterers , 2010, WSDM '10.

[21]  Yicheng Zhang,et al.  Identifying influential nodes in complex networks , 2012 .

[22]  Zhongke Gao,et al.  A directed weighted complex network for characterizing chaotic dynamics from time series , 2012 .

[23]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[24]  Jure Leskovec,et al.  Information diffusion and external influence in networks , 2012, KDD.

[25]  An Zeng,et al.  Iterative resource allocation for ranking spreaders in complex networks , 2014 .

[26]  Yi-Cheng Zhang,et al.  Leaders in Social Networks, the Delicious Case , 2011, PloS one.

[27]  Duanbing Chen,et al.  Path diversity improves the identification of influential spreaders , 2013, ArXiv.

[28]  Duanbing Chen,et al.  The small world yields the most effective information spreading , 2011, ArXiv.

[29]  Linyuan Lu,et al.  Effective spreading from multiple leaders identified by percolation in social networks , 2015, ArXiv.

[30]  Zhong-Ke Gao,et al.  Multivariate weighted complex network analysis for characterizing nonlinear dynamic behavior in two-phase flow , 2015 .

[31]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[32]  Zhuo-Ming Ren,et al.  Effects of the distance among multiple spreaders on the spreading , 2014 .

[33]  Ming Tang,et al.  Identifying effective multiple spreaders by coloring complex networks , 2014, ArXiv.

[34]  Y. Narahari,et al.  A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks , 2011, IEEE Transactions on Automation Science and Engineering.

[35]  Claudio Castellano,et al.  Thresholds for epidemic spreading in networks , 2010, Physical review letters.

[36]  Xiaofan Wang,et al.  Unified index to quantifying heterogeneity of complex networks , 2008 .

[37]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[38]  Hans J. Herrmann,et al.  Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.

[39]  Ming Tang,et al.  Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition , 2014, Scientific Reports.

[40]  Herbert W. Hethcote,et al.  The Mathematics of Infectious Diseases , 2000, SIAM Rev..

[41]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[42]  Piet Van Mieghem,et al.  The epidemic threshold in directed networks , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[43]  Yan Fu,et al.  A Novel Top-k Strategy for Influence Maximization in Complex Networks with Community Structure , 2015, PloS one.

[44]  Jure Leskovec,et al.  Defining and Evaluating Network Communities Based on Ground-Truth , 2012, ICDM.

[45]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[46]  Tao Zhou,et al.  The H-index of a network node and its relation to degree and coreness , 2016, Nature Communications.

[47]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[48]  Fang Zhou,et al.  Biological networks to the analysis of microarray data , 2006 .

[49]  Mahdi Jalili,et al.  Influence maximization of informed agents in social networks , 2015, Appl. Math. Comput..

[50]  Jiawei Luo,et al.  Identification of Essential Proteins Based on a New Combination of Local Interaction Density and Protein Complexes , 2015, PloS one.