Identification of key nodes in super-network based on improved PageRank
To solve the problem of insufficient resolution of the recognition algorithm of key nodes in super-network,the PageRank algorithm which uses adjacency node information to get better effect in the field of complex networks is improved and applied to the super-network to identify the key node.Besides,the hy-pergraph from the incidence matrix to the adjacency matrix transformation algorithm is realized,which re-duces the computational complexity.In this paper,we compare with the hypergraph super degree,node de-gree and adjacent information entropy in the real network.The experiment results prove that the proposed algorithm can identify the key nodes and has a better resolution.
万方数据
维普
