A novel measure to identify influential nodes in complex networks based on network global efficiency

Identifying influential nodes is a basic measure of characterizing the structure and dynamics in complex networks. In this paper, we use network global efficiency by removing edges to propose a new centrality measure for identifying influential nodes in complex networks. Differing from the traditional network global efficiency, the proposed measure is determined by removing edges from networks, not removing nodes. Instead of static structure properties which are exhibited by other traditional centrality measures, such as degree centrality (DC), betweenness centrality (BC) and closeness centrality (CC), we focus on the perspective of dynamical process and global structure in complex networks. Susceptible-infected (SI) model is utilized to evaluate the performance of the proposed method. Experimental results show that the proposed measure is more effective than the other three centrality measures.

[1]  Ping Hu,et al.  A HIGH ROBUSTNESS AND LOW COST CASCADING FAILURE MODEL BASED ON NODE IMPORTANCE IN COMPLEX NETWORKS , 2014 .

[2]  J. Hopfield,et al.  From molecular to modular cell biology , 1999, Nature.

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

[4]  Guanrong Chen,et al.  Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Attila Szolnoki,et al.  Effectiveness of conditional punishment for the evolution of public cooperation. , 2013, Journal of theoretical biology.

[6]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Réka Albert,et al.  Structural vulnerability of the North American power grid. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[9]  Yong Deng,et al.  SELF-SIMILARITY IN COMPLEX NETWORKS: FROM THE VIEW OF THE HUB REPULSION , 2013 .

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

[11]  Jing Wang,et al.  SIMILARITY INDEX BASED ON THE INFORMATION OF NEIGHBOR NODES FOR LINK PREDICTION OF COMPLEX NETWORK , 2013 .

[12]  Attila Szolnoki,et al.  Evolutionary dynamics of group interactions on structured populations: a review , 2013, Journal of The Royal Society Interface.

[13]  John Skvoretz,et al.  Node centrality in weighted networks: Generalizing degree and shortest paths , 2010, Soc. Networks.

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

[15]  Zhanli Zhang.  Information entropy of diffusion processes on complex networks , 2014 .

[16]  Linyuan Lu,et al.  Information filtering via preferential diffusion , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[18]  S. Mahadevan,et al.  Identifying influential nodes in weighted networks based on evidence theory , 2013 .

[19]  B. Wang,et al.  Evolutionary model on market ecology of investors and investments , 2013 .

[20]  Attila Szolnoki,et al.  Risk-driven migration and the collective-risk social dilemma , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  S. Strogatz.  Exploring complex networks , 2001, Nature.