Journal of Lanzhou University of Technology ›› 2020, Vol. 46 ›› Issue (5): 100-106.

• Automation Technique and Computer Technology • Previous Articles     Next Articles

A method for sorting nodes in complex networks based on degree and H index expansion

LU Peng-li, YU Zhou   

  1. College of Computer and Communication, Lanzhou Univ. of Tech., Lanzhou 730050, China
  • Received:2019-08-23 Online:2020-10-28 Published:2020-11-06

Abstract: The importance of identifying influential nodes in complex networks has attracted more and more attentions. Commonly used centrality indexes to identify the influence of nodes include betweenness centrality, degree centrality, closeness centrality, H-index centrality, K-shell centrality and so on. These indexes have some limitations in identifying influential nodes. On the basis of H-index centrality and degree centrality, a local DH index centrality index is proposed in this paper to identify influential nodes in the networks. This index takes into account the degree and H-index of the node itself and the H-index of neighboring nodes as well. The proposed index can evaluate the effectiveness of each centrality method to identify the influence of nodes in the networks by using SIR propagation model and monotone function (M). Our experimental results show that this proposed index can identify the influential nodes in some networks more effectively than commonly used centrality index.

Key words: complex networks, local DH-index centrality, SIR model, influential nodes

CLC Number: