Evaluating Influential Nodes in Social Networks by Local Centrality with a Coefficient

Influential nodes are rare in social networks, but their influence can quickly spread to most nodes in the network. Identifying influential nodes allows us to better control epidemic outbreaks, accelerate information propagation, conduct successful e-commerce advertisements, and so on. Classic methods for ranking influential nodes have limitations because they ignore the impact of the topology of neighbor nodes on a node. To solve this problem, we propose a novel measure based on local centrality with a coefficient. The proposed algorithm considers both the topological connections among neighbors and the number of neighbor nodes. First, we compute the number of neighbor nodes to identify nodes in cluster centers and those that exhibit the “bridge” property. Then, we construct a decreasing function for the local clustering coefficient of nodes, called the coefficient of local centrality, which ranks nodes that have the same number of four-layer neighbors. We perform experiments to measure node influence on both real and computer-generated networks using six measures: Degree Centrality, Betweenness Centrality, Closeness Centrality, K-Shell, Semi-local Centrality and our measure. The results show that the rankings obtained by the proposed measure are most similar to those of the benchmark Susceptible-Infected-Recovered model, thus verifying that our measure more accurately reflects the influence of nodes than do the other measures. Further, among the six tested measures, our method distinguishes node influence most effectively.

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

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

[3]  D. Krackhardt.  Assessing the political landscape: Structure, cognition, and power in organizations. , 1990 .

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

[5]  Bruce Alberts,et al.  Genes: we can't expect full understanding yet , 2000, Nature.

[6]  Víctor M Eguíluz,et al.  Epidemic threshold in structured scale-free networks. , 2002, Physical review letters.

[7]  Matthew Richardson,et al.  Trust Management for the Semantic Web , 2003, SEMWEB.

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

[9]  Thomas Petermann,et al.  Role of clustering and gridlike ordering in epidemic spreading. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[11]  Tao Zhou,et al.  Maximal planar networks with large clustering coefficient and power-law degree distribution. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  S. Havlin,et al.  Self-similarity of complex networks , 2005, Nature.

[13]  Shlomo Havlin,et al.  Origins of fractality in the growth of complex networks , 2005, cond-mat/0507216.

[14]  Sergey N. Dorogovtsev,et al.  Critical phenomena in complex networks , 2007, ArXiv.

[15]  Peter Druschel,et al.  Online social networks: measurement, analysis, and applications to distributed information systems , 2009 .

[16]  Steve Gregory,et al.  Finding Overlapping Communities Using Disjoint Community Detection Algorithms , 2009, CompleNet.

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

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

[19]  Mason A. Porter,et al.  Social Structure of Facebook Networks , 2011, ArXiv.

[20]  Lars Backstrom,et al.  Structural diversity in social contagion , 2012, Proceedings of the National Academy of Sciences.

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

[22]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.

[23]  Jun Ma,et al.  Ranking the spreading ability of nodes in complex networks based on local structure , 2014 .

[24]  Xiao-Long Ren,et al.  Review of ranking nodes in complex networks , 2014 .

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

[26]  Su Xiaoping,et al.  Leveraging neighborhood “structural holes” to identifying key spreaders in social networks , 2015 .

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

[28]  Ming Tang,et al.  Identify influential spreaders in complex networks, the role of neighborhood , 2015, ArXiv.