An effective heuristic clustering algorithm for mining multiple critical nodes in complex networks

DOI10.1016/j.physa.2021.126535OpenAlexW3209540979MaRDI QIDQ2668298

Xuelei Shi, Yunan Zheng, Yiguang Liu, Ying Wang

Publication date: 3 March 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2021.126535

zbMATH Keywords

clustering algorithmcomplex networksSIR modelinfluence maximizationmultiple influential spreaders

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Related Items

Information dimension based on \textit{Deng} entropy ⋮ Parallelism detection using graph labelling

Cites Work

• An index to quantify an individual's scientific research output
• DSIR double-rumors spreading model in complex networks
• Identifying influential spreaders in complex networks based on gravity formula
• Influential nodes ranking in complex networks: an entropy-based approach
• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• Identifying influential nodes in complex networks from global perspective
• Identifying multiple influential spreaders by a heuristic clustering algorithm
• A new status index derived from sociometric analysis
• Multi-Scale attributed node embedding