Identifying multiple influential spreaders based on generalized closeness centrality

Abstract To maximize the spreading influence of multiple spreaders in complex networks, one important fact cannot be ignored: the multiple spreaders should be dispersively distributed in networks, which can effectively reduce the redundance of information spreading. For this purpose, we define a generalized closeness centrality (GCC) index by generalizing the closeness centrality index to a set of nodes. The problem converts to how to identify multiple spreaders such that an objective function has the minimal value. By comparing with the K-means clustering algorithm, we find that the optimization problem is very similar to the problem of minimizing the objective function in the K-means method. Therefore, how to find multiple nodes with the highest GCC value can be approximately solved by the K-means method. Two typical transmission dynamics—epidemic spreading process and rumor spreading process are implemented in real networks to verify the good performance of our proposed method.

[1]  Alessandro Laio,et al.  Clustering by fast search and find of density peaks , 2014, Science.

[2]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .

[3]  Qiang Guo,et al.  Ranking the spreading influence in complex networks , 2013, ArXiv.

[4]  Yamir Moreno,et al.  Dynamics of rumor spreading in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Kezan Li,et al.  A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks , 2017 .

[6]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[7]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[8]  Piet Van Mieghem,et al.  Epidemic processes in complex networks , 2014, ArXiv.

[9]  Duanbing Chen,et al.  Vital nodes identification in complex networks , 2016, ArXiv.

[10]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[12]  Maxi San Miguel,et al.  A measure of individual role in collective dynamics , 2010, Scientific Reports.

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

[14]  Nong Ye,et al.  Propagation and immunization of infection on general networks with both homogeneous and heterogeneous components. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Jianguo Liu,et al.  Identifying multiple influential spreaders in term of the distance-based coloring , 2016 .

[16]  M. Small,et al.  Node importance for dynamical process on networks: a multiscale characterization. , 2011, Chaos.

[17]  Leandros Tassiulas,et al.  Detecting Influential Spreaders in Complex, Dynamic Networks , 2013, Computer.

[18]  Yamir Moreno,et al.  Absence of influential spreaders in rumor dynamics , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Stephen D. Reese,et al.  Mapping the blogosphere , 2007 .

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

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

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

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

[24]  Tao Zhou,et al.  Optimal contact process on complex networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[26]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

[27]  Jure Leskovec,et al.  Higher-order organization of complex networks , 2016, Science.

[28]  Zhuo-Ming Ren,et al.  Effects of multiple spreaders in community networks , 2014 .

[29]  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.

[30]  Qiang Guo,et al.  Locating influential nodes via dynamics-sensitive centrality , 2015, Scientific Reports.

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

[32]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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