Identify Influential Spreaders in Complex Real-World Networks

Identifying the most influential spreaders in a complex network is important in optimizing the use of available resource and controlling spreading behaviors on it. Centrality is usually used to measure the importance of a node within the network, such as degree, betweenness, closeness, eigenvector, k-core, etc. Here considering the local connection pattern of nodes in the network structure, we propose a new centrality measure which is based not only on the nearest neighborhood of a node, but also on its 2-step and 3-step neighbors. To evaluate its effectiveness, we use the classic spreading model to simulate the spreading efficiency of nodes in the network and compare the performance of the proposed centrality with the most widely used centrality of degree and coreness in ranking spreaders. Results show that the proposed centrality is a much more accurate measure to predict spreading capability of nodes in real-world networks.

[1]  Y. Moreno,et al.  Epidemic outbreaks in complex heterogeneous networks , 2001, cond-mat/0107267.

[2]  Robin Wilson,et al.  Graph theory and combinatorics , 1979 .

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

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

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

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

[7]  Vladimir Batagelj,et al.  An O(m) Algorithm for Cores Decomposition of Networks , 2003, ArXiv.

[8]  Glenn Lawyer,et al.  Understanding the influence of all nodes in a network , 2015, Scientific Reports.

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

[10]  Frank Schweitzer,et al.  A k-shell decomposition method for weighted networks , 2012, ArXiv.

[11]  M. Kendall.  A NEW MEASURE OF RANK CORRELATION , 1938 .

[12]  Phillip Bonacich,et al.  Eigenvector-like measures of centrality for asymmetric relations , 2001, Soc. Networks.

[13]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

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

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

[16]  Ming Tang,et al.  Effects of weak ties on epidemic predictability on community networks , 2012, Chaos.

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

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

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