2019
DOI: 10.3390/e22010052
|View full text |Cite
|
Sign up to set email alerts
|

Key Node Ranking in Complex Networks: A Novel Entropy and Mutual Information-Based Approach

Abstract: 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 approach (EMI) … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
21
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 33 publications
(32 citation statements)
references
References 45 publications
0
21
0
Order By: Relevance
“…2 j+1 = 1 then m 1 ≥ −1 so that H 0 ≥ 0 and H 1 ≥ H 0 ≥ 0. Furthermore, (26) and (27) imply that m 1 ∈ [−1, 0] and m 0 ∈ [0, 1]. The proof of Property (i) has been completed.…”
Section: Theorem 3 Let H εδmentioning
confidence: 88%
See 3 more Smart Citations
“…2 j+1 = 1 then m 1 ≥ −1 so that H 0 ≥ 0 and H 1 ≥ H 0 ≥ 0. Furthermore, (26) and (27) imply that m 1 ∈ [−1, 0] and m 0 ∈ [0, 1]. The proof of Property (i) has been completed.…”
Section: Theorem 3 Let H εδmentioning
confidence: 88%
“…where µ = 2.0 years −1 is the growth and death rate of the population, ε = 1.0 years −1 , δ = 0.1 days −1 , γ = 0.02 days −1 are the instantaneous per capita rates of leaving the exposed, infected and recovered stages, respectively, and V(t) denotes the vaccination. This model fits in the structure given by (26) where u(t) = V(t) acts as the control command. The initial conditions are given by S(0) = E(0) = I(0) = R(0) = 0.1.…”
Section: Simulation Examplesmentioning
confidence: 99%
See 2 more Smart Citations
“…So he measured node importance by entropy variation [ 48 ] which calculates the change of graph entropy when that node is removed. In order to capture a wider range and greater abundance of information, Li et al put forward entropy and mutual information-based centrality approach (EMI) [ 49 ] to take both topological and digital network characteristics into account. Fei et al used relative entropy [ 50 ] to choose appropriate centrality measures when dealing with different networks.…”
Section: Introductionmentioning
confidence: 99%