CPR-TOPSIS: a novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy
From MaRDI portal
Publication:2162956
Recommendations
- A modified weighted TOPSIS to identify influential nodes in complex networks
- A new method for identifying influential nodes and important edges in complex networks
- Identification of influential nodes in complex networks: method from spreading probability viewpoint
- Identifying influential nodes in complex networks based on network embedding and local structure entropy
- GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks
Cites work
- A generalized gravity model for influential spreaders identification in complex networks
- A new measure of identifying influential nodes: efficiency centrality
- A new status index derived from sociometric analysis
- A novel method to evaluate node importance in complex networks
- Collective dynamics of `small-world' networks
- GPN: A novel gravity model based on position and neighborhood to identify influential nodes in complex networks
- Identifying influential spreaders in complex networks based on gravity formula
- Identifying node importance based on evidence theory in complex networks
- Measure the structure similarity of nodes in complex networks based on relative entropy
Cited in
(2)
This page was built for publication: CPR-TOPSIS: a novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2162956)