HA: An Influential Node Identification Algorithm Based on Hub-Triggered Neighborhood Decomposition and Asymmetric Order-by-Order Recurrence Model

In recent years, the rise of power network security incidents caused by malicious attacks has drawn considerable attention to identifying influential nodes in power networks. Power networks are a special class of complex networks characterized by a high relative clustering coefficient, which reflects a more intricate connection between nodes. This paper proposes a novel node influence evaluation algorithm based on hub-triggered neighborhood decomposition and asymmetric order-by-order recurrence model. First, the concepts of network directionalization strategy and hub-triggered neighborhood decomposition are introduced to distinguish the functional differences among nodes in the virus-spreading process. Second, this paper proposes the concepts of infected and infecting potential, then constructs a calculation model with asymmetric characteristics based on the order-by-order recurrence method to fully use the information in the connection structure of the adjacent neighborhood. Finally, the influence of the hub node is evaluated by integrating the infected potential and infecting potential of neighbors of multiple orders. We compare our method with the traditional and state-of-the-art algorithms on six power networks regarding Susceptible-Infected-Recovered (SIR) correlation coefficients, imprecision functions, and algorithmic resolution. The experimental results show that the algorithm proposed in this paper is superior in the above aspects.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2025-03-13
DOI
https://doi.org/10.3390/e27030298
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

HA: An Influential Node Identification Algorithm Based on Hub-Triggered Neighborhood Decomposition and Asymmetric Order-by-Order Recurrence Model

G. Zhang, Yujie Dai, Min Zhao, Jiayun Li et al.
Entropy
Complex Network Analysis Techniques
article

HA: An Influential Node Identification Algorithm Based on Hub-Triggered Neighborhood Decomposition and Asymmetric Order-by-Order Recurrence Model

G. Zhang, Yujie Dai, Min Zhao, Jiayun Li, T. Zhao, Junhan Ye
article en

Abstract

In recent years, the rise of power network security incidents caused by malicious attacks has drawn considerable attention to identifying influential nodes in power networks. Power networks are a special class of complex networks characterized by a high relative clustering coefficient, which reflects a more intricate connection between nodes. This paper proposes a novel node influence evaluation algorithm based on hub-triggered neighborhood decomposition and asymmetric order-by-order recurrence model. First, the concepts of network directionalization strategy and hub-triggered neighborhood decomposition are introduced to distinguish the functional differences among nodes in the virus-spreading process. Second, this paper proposes the concepts of infected and infecting potential, then constructs a calculation model with asymmetric characteristics based on the order-by-order recurrence method to fully use the information in the connection structure of the adjacent neighborhood. Finally, the influence of the hub node is evaluated by integrating the infected potential and infecting potential of neighbors of multiple orders. We compare our method with the traditional and state-of-the-art algorithms on six power networks regarding Susceptible-Infected-Recovered (SIR) correlation coefficients, imprecision functions, and algorithmic resolution. The experimental results show that the algorithm proposed in this paper is superior in the above aspects.

EntropyVol. 27(3)
Beijing University of Posts and Telecommunications (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Sustainable cities and communities
Openalex Percentile: Top 96%
Complex Network Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.