A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Key Node Ranking in Complex Networks: A Novel Entropy and Mutual Information-Based Approach
2019
Entropy
Numerous problems in many fields can be solved effectively through the approach of modeling by complex network analysis. Finding key nodes is one of the most important and challenging problems in network analysis. In previous studies, methods have been proposed to identify key nodes. However, they rely mainly on a limited field of local information, lack large-scale access to global information, and are also usually NP-hard. In this paper, a novel entropy and mutual information-based centrality
doi:10.3390/e22010052
pmid:33285827
pmcid:PMC7516483
fatcat:ydtrhvcdvbdz5mlvrpitzabpeu