Bi-directional h-index: A new measure of node centrality in weighted and directed networks. Issue 1 (February 2018)

• Record Type: Journal Article
• Authors: Zhai, Li; Yan, Xiangbin; Zhang, Guojing
• Is Part Of: Journal of informetrics. Volume 12:Issue 1(2018)
• Page Start: 299
• Page End: 314
• Publication Date: 2018-02
• Subjects: Weighted directed networks -- Node centrality -- H-index -- Asynchronous updating; Library statistics -- Periodicals; Information science -- Statistical methods -- Periodicals; Bibliometrics -- Periodicals; Bibliothèques -- Statistiques -- Périodiques; Sciences de l'information -- Méthodes statistiques -- Périodiques; Bibliométrie -- Périodiques; 020.727
• DOI: 10.1016/j.joi.2018.01.004
• Languages: English
• ISSNs: 1751-1577

Abstract

Highlights: Bi-directional h-index is a centrality measure in weighted directed networks. Bi-directional h-index is calculated iteratively using h-index algorithm. We prove the convergence of the iterative process after finite iterations. An asynchronous updating process is provided to calculate the limits. Bi-directional h-index establishes a greater conceptual framework. Abstract: This paper builds an index family, named bi-directional h-index, to measure node centrality in weighted directed networks. Bi-directional h-index takes the directed degree centrality as the initial value and iteratively uses more network information to update the node's importance. We prove the convergence of the iterative process after finite iterations and introduce an asynchronous updating process that provides a decentralized, local method to calculate the bi-directional h-index in large-scale networks and dynamic networks. The theoretical analysis manifests that the bi-directional h-index is feasible and significant for establishing a greater conceptual framework that includes some existing index concepts, such as lobby index, node's h-index, c-index and iterative c-index. An example using journal citation networks indicates that the bi-directional h-index is different from directed degree centrality, directed node strength, directed h-degree and the HITS algorithm in ranking node importance. It is irreplaceable and can reflect these measures of node's importance.