Sub-graph degree-based bridge centrality algorithm

Chinenye Ezeh (), Ren Tao, Yan-Jie Xu (), Shi-Xiang Sun () and Li Zhe ()
Additional contact information
Chinenye Ezeh: College of Information Science and Engineering, Northeastern University, No. 195, Chuangxin Road, Hunnan District, Shenyang, 110169, P. R. China
Ren Tao: College of Information Science and Engineering, Northeastern University, No. 195, Chuangxin Road, Hunnan District, Shenyang, 110169, P. R. China
Yan-Jie Xu: College of Information Science and Engineering, Northeastern University, No. 195, Chuangxin Road, Hunnan District, Shenyang, 110169, P. R. China
Shi-Xiang Sun: College of Information Science and Engineering, Northeastern University, No. 195, Chuangxin Road, Hunnan District, Shenyang, 110169, P. R. China
Li Zhe: College of Information Science and Engineering, Northeastern University, No. 195, Chuangxin Road, Hunnan District, Shenyang, 110169, P. R. China

International Journal of Modern Physics C (IJMPC), 2021, vol. 32, issue 07, 1-27

Abstract: The design of centrality metric algorithms to distinguish influential nodes on networks has become a very attractive research interest lately. This recent development is due to the fact that detection of powerful nodes can be very helpful in various situations such as containment of epidemic spread and so on. Many useful centrality algorithms had been proposed in the past but some of them have inherent shortcomings. Some of these algorithms are designed to capture global or local network details but little efforts have been channeled to explore techniques based on sub-graph information. Therefore, a novel sub-graph degree-based bridge centrality (SDBC) algorithm to distinguish bridge nodes on networks is proposed in this work. A pivot node’s sphere of influence is captured and this includes its 1-hop and 2-hop neighborhood with itself inclusive. A model is proposed to reduce links of all 2-hop neighbors to 1-hop links. The sub-graph degree distribution of all nodes under the pivot node’s sphere of influence is computed and afterwards, the pivot node’s bridging influence capacity is quantified using Dehmer’s entropy model. The proposed algorithm is designed to capture the topological and strength of connections between nodes. In essence, a tuning parameter is used to automatically switch between unweighted and weighted networks, a feature that makes the algorithm unique. Additionally, SDBC does not use two factor computation unlike previous bridge node detection algorithms. Various experimental comparisons were carried out against some selected centrality metrics and SDBC performed well against the compared algorithms. The results prove that the proposed method is quite efficient in distinguishing bridge nodes on complex networks.

Keywords: Sub-graph degree; entropy; node ranking; bridge nodes; centrality algorithm (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S012918312150090X
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:32:y:2021:i:07:n:s012918312150090x

Ordering information: This journal article can be ordered from

DOI: 10.1142/S012918312150090X

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().