EHC: Extended H-index Centrality measure for identification of users’ spreading influence in complex networks

Abstract In recent research, the importance of determining social network users’ spreading influence and ranking them has attracted plenty of attention. H-index is one of the methods that have been presented for this purpose, and determines the spreading capability of a node based on the degrees of its neighbors. In this method, part of the information on the neighbors is disregarded, which reduces ranking accuracy. In this paper, a measure is presented for specification of the centrality of nodes through extension of the H-index notion. The results of experimentation over real-world and artificial datasets demonstrate that the proposed measure exhibits higher accuracy and efficiency than in the other compared methods.

[1]  Guojing Zhang,et al.  Bi-directional h-index: A new measure of node centrality in weighted and directed networks , 2018, J. Informetrics.

[2]  Xin Wang,et al.  Friend recommendation with content spread enhancement in social networks , 2015, Inf. Sci..

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

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

[5]  Sangwook Kim,et al.  Identifying and ranking influential spreaders in complex networks by neighborhood coreness , 2014 .

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

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

[8]  Marie-Claude Boily,et al.  Dynamical systems to define centrality in social networks , 2000, Soc. Networks.

[9]  Biswanath Dutta,et al.  Identifying influential spreaders in complex networks based on kshell hybrid method , 2018, Physica A: Statistical Mechanics and its Applications.

[10]  Phillip Bonacich,et al.  Some unique properties of eigenvector centrality , 2007, Soc. Networks.

[11]  R W Eash,et al.  EQUILIBRIUM TRAFFIC ASSIGNMENT ON AN AGGREGATED HIGHWAY NETWORK FOR SKETCH PLANNING , 1983 .

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

[13]  Stefan M. Wild,et al.  Maximizing influence in a competitive social network: a follower's perspective , 2007, ICEC.

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

[15]  Chung-Yuan Huang,et al.  A computer virus spreading model based on resource limitations and interaction costs , 2013, J. Syst. Softw..

[16]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

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

[18]  Mohammad Ali Nematbakhsh,et al.  IMPROVING DETECTION OF INFLUENTIAL NODES IN COMPLEX NETWORKS , 2015, ArXiv.

[19]  Marko Bajec,et al.  Robust network community detection using balanced propagation , 2011, ArXiv.

[20]  Yabing Yao,et al.  Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient , 2018 .

[21]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[23]  Ya Zhao,et al.  Fast ranking influential nodes in complex networks using a k-shell iteration factor , 2016 .

[24]  Hassan Haghighi,et al.  INCIM: A community-based algorithm for influence maximization problem under the linear threshold model , 2016, Inf. Process. Manag..

[25]  Keyhan Khamforoosh,et al.  Influence maximization in social networks based on TOPSIS , 2018, Expert Syst. Appl..

[26]  Chao Li,et al.  Identification of influential spreaders based on classified neighbors in real-world complex networks , 2018, Appl. Math. Comput..

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

[28]  M. Newman.  Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Alistair Moffat,et al.  A similarity measure for indefinite rankings , 2010, TOIS.

[30]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[32]  Mohammad Ali Nematbakhsh,et al.  Identification of multi-spreader users in social networks for viral marketing , 2017, J. Inf. Sci..

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

[34]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[35]  A. Fatemi,et al.  Influential nodes ranking in complex networks: An entropy-based approach , 2017 .

[36]  Yong Deng,et al.  A modified weighted TOPSIS to identify influential nodes in complex networks , 2016 .

[37]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[38]  Choy Heng Lai,et al.  Epidemic spreading induced by diversity of agents' mobility. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[41]  Ahmad Zareie,et al.  A hierarchical approach for influential node ranking in complex social networks , 2018, Expert Syst. Appl..

[42]  Mohammad Ali Nematbakhsh,et al.  Identification of influential users by neighbors in online social networks , 2017 .

[43]  Wei Chen,et al.  Scalable influence maximization for prevalent viral marketing in large-scale social networks , 2010, KDD.

[44]  Alireza Abdollahpouri,et al.  BridgeRank: A novel fast centrality measure based on local structure of the network , 2017 .

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

[46]  Florian Probst,et al.  Online social networks: A survey of a global phenomenon , 2012 .

[47]  Jiadong Ren,et al.  CDA: A Clustering Degree Based Influential Spreader Identification Algorithm in Weighted Complex Network , 2018, IEEE Access.

[48]  Allan Borodin,et al.  Threshold Models for Competitive Influence in Social Networks , 2010, WINE.

[49]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[50]  A. Arenas,et al.  Models of social networks based on social distance attachment. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[51]  Xiufen Zou,et al.  A new centrality measure of nodes in multilayer networks under the framework of tensor computation , 2018 .

[52]  Gang Xie,et al.  Efficient identification of node importance in social networks , 2016, Inf. Process. Manag..

[53]  Chao Li,et al.  Improved centrality indicators to characterize the nodal spreading capability in complex networks , 2018, Appl. Math. Comput..

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

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

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

[57]  V. Latora,et al.  Disease spreading in populations of moving agents , 2007, 0707.1673.