Key Node Identification Method Based on Multilayer Neighbor Node Gravity and Information Entropy.

In the field of complex network analysis, accurately identifying key nodes is crucial for understanding and controlling information propagation. Although several local centrality methods have been proposed, their accuracy may be compromised if interactions between nodes and their neighbors are not fully considered. To address this issue, this paper proposes a key node identification method based on multilayer neighbor node gravity and information entropy (MNNGE). The method works as follows: First, the relative gravity of the nodes is calculated based on their weights. Second, the direct gravity of the nodes is calculated by considering the attributes of neighboring nodes, thus capturing interactions within local triangular structures. Finally, the centrality of the nodes is obtained by aggregating the relative and direct gravity of multilayer neighbor nodes using information entropy. To validate the effectiveness of the MNNGE method, we conducted experiments on various real-world network datasets, using evaluation metrics such as the susceptible-infected-recovered (SIR) model, Kendall τ correlation coefficient, Jaccard similarity coefficient, monotonicity, and complementary cumulative distribution function. Our results demonstrate that MNNGE can identify key nodes more accurately than other methods, without requiring parameter settings, and is suitable for large-scale complex networks.