中心性
钥匙(锁)
截断(统计)
半径
频道(广播)
计算机科学
数学
物理
拓扑(电路)
计算机网络
组合数学
统计
计算机安全
作者
Pingle Yang,Fanyuan Meng,Laijun Zhao,Lixin Zhou
标识
DOI:10.1016/j.chaos.2022.112974
摘要
Identifying key nodes that have a significant impact on network structure and function is a fundamental issue with numerous practical applications and technical challenges. The gravity model is a unique method for identifying key nodes that has piqued the interest of many researchers. Most of existing gravity-based methods have limitations in that they neglect the surrounding environment of a node in deeper level such as node location, neighborhood topology, higher-order neighbors, multiple interaction paths, and so on. They assume that inter-node interactions occur only along the shortest path, which is not true and renders them inaccurate in many cases. Based on our defined adaptive truncation radius and "looseness distance" considering omni-channel paths, we propose a new gravity centrality method that integrates multiple node properties and accurately characterizes node interaction distance. Numerical simulations indicate that (i) the gravity model is a good approximation of node interaction effect and (ii) a derivative method outperforms recent high-performing node importance evaluation methods in terms of distinguishing ability, accuracy, spreading ability, and imprecision function with an acceptable time complexity. Furthermore, the proposed method exhibits good stability on networks of varying scales and structural characteristics.
科研通智能强力驱动
Strongly Powered by AbleSci AI