A Key Node Identification Method Based on Binomial Entropy and Van der Waals Forces between Neighboring Nodes
Ranking importance in nodes is a commonly used analysis method for identifying key nodes in complex networks,and importance of analyzing nodes in the network is a great help to a deeper under-standing network characteristics.In order to further improve the accuracy of node evaluation based on ex-isting methods,this paper introduces the concept of Binomial Entropy to quantify the importance of nodes in the network,measures the mutual influence between nodes through neighborhood similarity,and simul-taneously uses Van der Waals force to abstract the interaction between nodes.Therefore,a key node iden-tification method based on binomial entropy and Van der Waals force between neighboring nodes is pro-posed.This method is a comprehensive consideration of the local and global characteristics of nodes from the overall information flow of the network and the location and interaction relationship between adjacent nodes,and a selection from three similar algorithms to verify the performance through three evaluation in-dicators.The experimental results show that the algorithm in this paper is good in performance in judging important nodes.
complex networksbinomial entropyneighborhood topologyVan der Waals forcesnode identification
国家科技期刊平台
NSTL
万方数据
