Influential node detection of social networks based on network invulnerability

DOI10.1016/j.physleta.2020.126879zbMath1448.91210OpenAlexW3084999363MaRDI QIDQ2212967

Qianru Zhou, Jiafei Liu, Gaolin Chen, Min Li, Shuming 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

zbMATH Keywords

social networklocal efficiencyglobal efficiencyinfluential nodesinvulnerability

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Three-way group consensus decision based on hierarchical social network consisting of decision makers and participants

Cites Work

• PageRank centrality for temporal networks
• Detecting critical nodes in sparse graphs
• What's in a crowd? Analysis of face-to-face behavioral networks
• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• 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
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• A Non-Parametric Test of Independence
• THE TREATMENT OF TIES IN RANKING PROBLEMS

This page was built for publication: Influential node detection of social networks based on network invulnerability