Node importance ranking method based on network directed relationship
To solve the problem that the distribution of node importance characteristics is chaotic and differ-ent due to multiple network shunting,a node importance ranking method based on network directed relation-ship is proposed.A dynamic model of the complex network structure with multiple shunts is established,and the real-time state value of the nodes in the network basin is dynamically calculated according to the linear change relationship of the nodes.According to the real-time state value of the node,the importance contribution parameter between the preset node and any point is obtained through the efficiency matrix,which can reflect the degree of association between two nodes,and implement importance ranking according to the size of the association.The experiment results show that the proposed method can accurately sort nodes with a global importance value ranging from 0.021 to 0.085,and can complete the sorting of less im-portant nodes within 1 s.
NETL
NSTL
万方数据
