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

HA:一种基于枢纽触发邻域分解和非对称逐阶递归模型的影响力节点识别算法

阅读:1

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.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。