Identifying influential nodes in complex networks based on network embedding and local structure entropy
From MaRDI portal
Publication:6607285
DOI10.1088/1742-5468/ACDCEBMaRDI QIDQ6607285FDOQ6607285
Authors: Pengli Lu, Junxia Yang, Teng Zhang 
Publication date: 18 September 2024
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Recommendations
- Identifying influential nodes in complex networks: a node information dimension approach
- A new method for identifying influential nodes and important edges in complex networks
- Identifying influential nodes in complex networks from global perspective
- Identifying influential nodes based on fuzzy local dimension in complex networks
- Identifying critical nodes in complex networks based on neighborhood information
Cites Work
- A NEW MEASURE OF RANK CORRELATION
- A Mathematical Theory of Communication
- Collective dynamics of `small-world' networks
- Possible generalization of Boltzmann-Gibbs statistics.
- The centrality index of a graph
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Identifying influential spreaders in complex networks based on gravity formula
- Identifying influential nodes in complex networks from global perspective
- A generalized gravity model for influential spreaders identification in complex networks
- Identifying influential spreaders in complex networks based on improved k-shell method
- A novel method to evaluate node importance in complex networks
- CPR-TOPSIS: a novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy
- Identifying influential nodes in social networks: a voting approach
- Generalized network dismantling
This page was built for publication: Identifying influential nodes in complex networks based on network embedding and local structure entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6607285)
