4.7 Article

AOGC: An improved gravity centrality based on an adaptive truncation radius and omni-channel paths for identifying key nodes in complex networks

Journal

CHAOS SOLITONS & FRACTALS
Volume 166, Issue -, Pages -

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.chaos.2022.112974

Keywords

Key nodes; Gravity model; Omni-channel paths; Quasi-local connectivity; Complex networks

Ask authors/readers for more resources

Identifying key nodes that have a significant impact on network structure and function is an important issue. Existing gravity-based methods have limitations in considering the surrounding environment and assuming inter-node interactions only along the shortest path. We propose a new gravity centrality method that integrates multiple node properties and accurately characterizes node interaction distance. Numerical simulations show that our method outperforms recent high-performing node importance evaluation methods in terms of accuracy and spreading ability.
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 distanceconsidering 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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available