Local structure entropy of complex networks
Qi Zhang, Meizhu Li, Yuxian Du, Yong Deng

TL;DR
This paper introduces a local structure entropy method based on degree centrality and statistical mechanics to identify influential nodes in complex networks, focusing on intermediate nodes that connect high-degree nodes.
Contribution
The paper proposes a novel local structure entropy approach that uses local network influence to identify influential intermediate nodes in complex networks.
Findings
The method effectively identifies influential nodes in real networks.
Simulation results show the method's efficacy and rationality.
The approach outperforms some existing methods in identifying key nodes.
Abstract
Identifying influential nodes in the complex networks is of theoretical and practical significance. There are many methods are proposed to identify the influential nodes in the complex networks. In this paper, a local structure entropy which is based on the degree centrality and the statistical mechanics is proposed to identifying the influential nodes in the complex network. In the definition of the local structure entropy, each node has a local network, the local structure entropy of each node is equal to the structure entropy of the local network. The main idea in the local structure entropy is try to use the influence of the local network to replace the node's influence on the whole network. The influential nodes which are identified by the local structure entropy are the intermediate nodes in the network. The intermediate nodes which connect those nodes with a big value of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Computational Drug Discovery Methods
