1. Important Node Recognition in Hypernetworks Based on Node Propagation Entropy.
- Author
-
WU Yinghan, TIAN Kuo, LI Mingda, and HU Feng
- Subjects
INFORMATION theory ,RECOGNITION (Philosophy) ,ENTROPY (Information theory) ,ENTROPY ,ACCOUNTING methods - Abstract
It is a basic and challenging task to identify important nodes in hypernetworks, and the related research is of great value for further analysis of network topology and functional characteristics. In order to break through the limitations of the existing important node recognition methods, an important node recognition method based on node propagation entropy is proposed by using hypergraph and information entropy theory. This method takes into account both local and global topology information of nodes, uses the node clustering coefficient and the number of neighbors to represent the local propagation influence of node information, the global influence of the node information is reflected by the shortest path between nodes and K-shell centrality, and fully considers the influence of nodes and their neighbors, the importance of nodes in the network is represented by the size of node propagation entropy finally. Using monotonicity, robustness and SIR propagation model evaluation criteria, compared with other methods on six real networks from different fields, experimental results show that the proposed method can identify the important nodes in the hypernetwork accurately and effectively. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF