Evaluate node importance by decomposing network with a recursive percolation process

DOI10.1142/S0219525924500024MaRDI QIDQ6577738zbMATH OpenFDO

Authors Hui Wang, Zhenyu Yang, Run-Ran Liu, Donghui Hu, Ming Li

Publication date 24 July 2024

Published in Advances in Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219525924500024

zbMATH Keywords

important node identificationnetwork structure analysisnode rankpercolation process

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Time-dependent percolation in statistical mechanics (82C43)

Recommendations

• Determination methods of node importance in complex networks
• Vital nodes identification by the hybrid K-shell method based on vertex strength
• Node evaluation method based on importance contribution in scale-free networks
• Critical network node evaluation based on \(m\)-order neighbor nodes
• A new method for node importance evaluation based on multi-domain topology characteristics in complex networks

Cites work

• A NEW MEASURE OF RANK CORRELATION
• Local structure can identify and quantify influential global spreaders in large scale social networks
• Network science. With Márton Pósfai
• Networks
• Percolation on complex networks: theory and application

This page was built for publication: Evaluate node importance by decomposing network with a recursive percolation process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6577738)