Identifying influential nodes in complex networks: A node information dimension approach.

In the field of complex networks, how to identify influential nodes is a significant issue in analyzing the structure of a network. In the existing method proposed to identify influential nodes based on the local dimension, the global structure information in complex networks is not taken into consideration. In this paper, a node information dimension is proposed by synthesizing the local dimensions at different topological distance scales. A case study of the Netscience network is used to illustrate the efficiency and practicability of the proposed method.

[1]  Han Zhao,et al.  Identifying influential nodes in complex networks with community structure , 2013, Knowl. Based Syst..

[2]  Qi Zhang,et al.  Measure the structure similarity of nodes in complex networks based on relative entropy , 2018 .

[3]  Qi Liu,et al.  Identifying influential nodes based on local dimension , 2014 .

[4]  Yong Deng,et al.  Measuring transferring similarity via local information , 2018 .

[5]  Etienne Huens,et al.  Geographical dispersal of mobile communication networks , 2008, 0802.2178.

[6]  Pawan Kumar,et al.  Notice of Violation of IEEE Publication Principles The Anatomy of a Large-Scale Hyper Textual Web Search Engine , 2009 .

[7]  Yong Deng,et al.  A novel method for forecasting time series based on fuzzy logic and visibility graph , 2017, Advances in Data Analysis and Classification.

[8]  Yong Deng,et al.  Evidential Supplier Selection Based on DEMATEL and Game Theory , 2018, Int. J. Fuzzy Syst..

[9]  Shlomo Havlin,et al.  Fractal and transfractal recursive scale-free nets , 2007 .

[10]  Lin Wang,et al.  Coupled disease–behavior dynamics on complex networks: A review , 2015, Physics of Life Reviews.

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

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

[13]  Qing Wang,et al.  Efficient processing of multiple nested event pattern queries over multi-dimensional event streams based on a triaxial hierarchical model , 2016, Artif. Intell. Medicine.

[14]  Sidney Redner,et al.  Extremal Properties of Random Structures , 2003, ArXiv.

[15]  S. Havlin,et al.  How to calculate the fractal dimension of a complex network: the box covering algorithm , 2007, cond-mat/0701216.

[16]  Li Tao,et al.  New parallel processing strategies in complex event processing systems with data streams , 2017, Int. J. Distributed Sens. Networks.

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

[18]  Bingyi Kang,et al.  Stable strategies analysis based on the utility of Z-number in the evolutionary games , 2018, Appl. Math. Comput..

[19]  Yong Deng,et al.  Dependence assessment in human reliability analysis based on evidence credibility decay model and IOWA operator , 2018 .

[20]  Shuigeng Zhou,et al.  Fractal scale-free networks resistant to disease spread , 2008, 0804.3186.

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

[22]  David P. Dailey.  Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete , 1980, Discret. Math..

[23]  S. N. Dorogovtsev,et al.  Evolution of networks with aging of sites , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

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

[25]  Duanbing Chen,et al.  Path diversity improves the identification of influential spreaders , 2013, ArXiv.

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

[27]  K. Goh,et al.  Fractality and self-similarity in scale-free networks , 2007 .

[28]  Sergey Brin,et al.  Reprint of: The anatomy of a large-scale hypertextual web search engine , 2012, Comput. Networks.

[29]  Shuigeng Zhou,et al.  Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices , 2007 .

[30]  Fang Hu,et al.  Multi-index algorithm of identifying important nodes in complex networks based on linear discriminant analysis , 2015 .

[31]  S. Havlin,et al.  Dimension of spatially embedded networks , 2011 .

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

[33]  Zhen Wang,et al.  Impact of Social Punishment on Cooperative Behavior in Complex Networks , 2013, Scientific Reports.

[34]  Jens Lehmann,et al.  DBpedia: A Nucleus for a Web of Open Data , 2007, ISWC/ASWC.

[35]  Yong Deng,et al.  Failure mode and effects analysis based on D numbers and TOPSIS , 2016, Qual. Reliab. Eng. Int..

[36]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[37]  Gábor Csányi,et al.  Structure of a large social network. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[38]  Yong Deng,et al.  Dependent Evidence Combination Based on Shearman Coefficient and Pearson Coefficient , 2018, IEEE Access.

[39]  A. Barabasi,et al.  Network medicine : a network-based approach to human disease , 2010 .

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