How to Identify the Most Powerful Node in Complex Networks? A Novel Entropy Centrality Approach

Centrality is one of the most studied concepts in network analysis. Despite an abundance of methods for measuring centrality in social networks has been proposed, each approach exclusively characterizes limited parts of what it implies for an actor to be “vital” to the network. In this paper, a novel mechanism is proposed to quantitatively measure centrality using the re-defined entropy centrality model, which is based on decompositions of a graph into subgraphs and analysis on the entropy of neighbor nodes. By design, the re-defined entropy centrality which describes associations among node pairs and captures the process of influence propagation can be interpreted explained as a measure of actor potential for communication activity. We evaluate the efficiency of the proposed model by using four real-world datasets with varied sizes and densities and three artificial networks constructed by models including Barabasi-Albert, Erdos-Renyi and Watts-Stroggatz. The four datasets are Zachary’s karate club, USAir97, Collaboration network and Email network URV respectively. Extensive experimental results prove the effectiveness of the proposed method.

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

[2]  S. Mahadevan,et al.  A modified evidential methodology of identifying influential nodes in weighted networks , 2013 .

[3]  Danail Bonchev,et al.  Complexity in chemistry : introduction and fundamentals , 2003 .

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

[5]  Peter H. Reingen,et al.  Social Ties and Word-of-Mouth Referral Behavior , 1987 .

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

[7]  Mathematical Biophysics.  ENTROPY AND THE COMPLEXITY OF GRAPHS: II. THE INFORMATION CONTENT OF DIGRAPHS AND INFINITE GRAPHS , 1968 .

[8]  Alexander G. Nikolaev,et al.  On efficient use of entropy centrality for social network analysis and community detection , 2015, Soc. Networks.

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

[10]  Zhe-ming Lu,et al.  Using mapping entropy to identify node centrality in complex networks , 2016 .

[11]  Christopher M. Danforth,et al.  Twitter reciprocal reply networks exhibit assortativity with respect to happiness , 2011, J. Comput. Sci..

[12]  Liguo Fei,et al.  A new method to identify influential nodes based on relative entropy , 2017 .

[13]  José Rui Figueira,et al.  Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems , 2013, Eur. J. Oper. Res..

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

[15]  Matthias Dehmer,et al.  Global information processing in gene networks: Fault tolerance , 2007, 2007 2nd Bio-Inspired Models of Network, Information and Computing Systems.

[16]  Stephan Borgert,et al.  On Entropy-Based Molecular Descriptors: Statistical Analysis of Real and Synthetic Chemical Structures , 2009, J. Chem. Inf. Model..

[17]  Nicholas A. Christakis,et al.  The Spread of Sleep Loss Influences Drug Use in Adolescent Social Networks , 2010, PloS one.

[18]  Yongtang Shi,et al.  Bounds for degree-based network entropies , 2015, Appl. Math. Comput..

[19]  Matthias Dehmer,et al.  INFORMATION-THEORETIC CONCEPTS FOR THE ANALYSIS OF COMPLEX NETWORKS , 2008, Appl. Artif. Intell..

[20]  Amy Nicole Langville,et al.  Google's PageRank and beyond - the science of search engine rankings , 2006 .

[21]  Guillermo Owen,et al.  Centrality and power in social networks: a game theoretic approach , 2003, Math. Soc. Sci..

[22]  Peter Grindrod,et al.  A dynamical systems view of network centrality , 2014, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

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

[24]  Claude E. Shannon,et al.  The Mathematical Theory of Communication , 1950 .

[25]  An Zeng,et al.  Ranking spreaders by decomposing complex networks , 2012, ArXiv.

[26]  J. A. Rodríguez-Velázquez,et al.  Spectral measures of bipartivity in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[28]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[29]  Tucker R. Balch,et al.  Hierarchic Social Entropy: An Information Theoretic Measure of Robot Group Diversity , 2000, Auton. Robots.

[30]  Linyuan Lü,et al.  Toward link predictability of complex networks , 2015, Proceedings of the National Academy of Sciences.

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

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

[33]  Yongtang Shi,et al.  Extremality of degree-based graph entropies , 2014, Inf. Sci..

[34]  Thomas Wilhelm,et al.  What is a complex graph , 2008 .

[35]  Nicholas A. Christakis,et al.  Breaking Up Is Hard to Do, Unless Everyone Else Is Doing It Too: Social Network Effects on Divorce in a Longitudinal Sample , 2013, Social forces; a scientific medium of social study and interpretation.

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

[37]  Charles H. Hubbell.  An Input-Output Approach to Clique Identification , 1965 .

[38]  Peter Grindrod,et al.  A Matrix Iteration for Dynamic Network Summaries , 2013, SIAM Rev..

[39]  Jean-Charles Delvenne,et al.  Flow graphs: interweaving dynamics and structure , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[40]  Igor M. Sokolov,et al.  Unfolding accessibility provides a macroscopic approach to temporal networks , 2012, Physical review letters.

[41]  Jasjit Singh,et al.  Collaborative Networks as Determinants of Knowledge Diffusion Patterns , 2005, Manag. Sci..

[42]  Alain Barrat,et al.  Modeling temporal networks using random itineraries , 2013, Physical review letters.

[43]  Jens Christian Claussen,et al.  Offdiagonal complexity: A computationally quick complexity measure for graphs and networks , 2004, q-bio/0410024.

[44]  Dongqing Xie,et al.  Social influence modeling using information theory in mobile social networks , 2017, Inf. Sci..

[45]  S. Mahadevan,et al.  A new method of identifying influential nodes in complex networks based on TOPSIS , 2014 .

[46]  Xiao Zhang,et al.  Localization and centrality in networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[47]  L. Freeman,et al.  Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .

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

[49]  Conrado J. Pérez Vicente,et al.  Diffusion dynamics on multiplex networks , 2012, Physical review letters.

[50]  Matthias Dehmer,et al.  Information processing in complex networks: Graph entropy and information functionals , 2008, Appl. Math. Comput..

[51]  David F. Gleich,et al.  PageRank beyond the Web , 2014, SIAM Rev..

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

[53]  I. N. A. C. I. J. H. Fowler.  Book Review: Connected: The surprising power of our social networks and how they shape our lives. , 2009 .

[54]  Matthias Dehmer,et al.  On Extremal Properties of Graph Entropies , 2012 .

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

[56]  Duanbing Chen,et al.  Identifying Influential Spreaders by Weighted LeaderRank , 2013, ArXiv.

[57]  Frank Tutzauer,et al.  Entropy as a measure of centrality in networks characterized by path-transfer flow , 2007, Soc. Networks.

[58]  Ginestra Bianconi,et al.  Entropy measures for networks: toward an information theory of complex topologies. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[59]  Matthias Dehmer,et al.  A history of graph entropy measures , 2011, Inf. Sci..

[60]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[61]  Matthias Dehmer,et al.  Fault tolerance of information processing in gene networks , 2009 .

[62]  Martin G. Everett,et al.  Role similarity and complexity in social networks , 1985 .

[63]  Nicholas A. Christakis,et al.  Social contagion theory: examining dynamic social networks and human behavior , 2011, Statistics in medicine.

[64]  E. Trucco.  A note on the information content of graphs , 1956 .

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

[66]  Shujuan Cao,et al.  Degree-based entropies of networks revisited , 2015, Appl. Math. Comput..

[67]  M. Zelen,et al.  Rethinking centrality: Methods and examples☆ , 1989 .

[68]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[69]  N. Trinajstic,et al.  Information theory, distance matrix, and molecular branching , 1977 .

[70]  N. Rashevsky.  Life, information theory, and topology , 1955 .

[71]  Hernán A. Makse,et al.  Finding Influential Spreaders from Human Activity beyond Network Location , 2015, PloS one.