Influential node detection of social networks based on network invulnerability
DOI10.1016/J.PHYSLETA.2020.126879zbMATH Open1448.91210OpenAlexW3084999363MaRDI QIDQ2212967FDOQ2212967
Authors: Gaolin Chen, Shuming Zhou, Jiafei Liu, Min Li, Qianru Zhou 
Publication date: 27 November 2020
Published in: Physics Letters. A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physleta.2020.126879
Recommendations
- A new metric to quantify influence of nodes in social networks
- Identifying influential nodes in complex networks from global perspective
- A new method for identifying influential nodes and important edges in complex networks
- A novel centrality measure for identifying influential nodes based on minimum weighted degree decomposition
- Identifying influential nodes based on fuzzy local dimension in complex networks
Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- What's in a crowd? Analysis of face-to-face behavioral networks
- A Non-Parametric Test of Independence
- THE TREATMENT OF TIES IN RANKING PROBLEMS
- Detecting critical nodes in sparse graphs
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- PageRank centrality for temporal networks
- Identifying influential nodes in complex networks from global perspective
- Identifying influential spreaders in complex networks based on improved k-shell method
- A novel method to evaluate node importance in complex networks
Cited In (3)
This page was built for publication: Influential node detection of social networks based on network invulnerability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2212967)
