Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths

DOI10.1007/S11424-021-0111-7zbMath1483.92140OpenAlexW3176003797MaRDI QIDQ2121163

Yangyang Luan, Zhong-Kui Bao, Hai-feng Zhang

Publication date: 1 April 2022

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-021-0111-7

zbMATH Keywords

complex networksinfluential spreadernumber of shortest paths

Mathematics Subject Classification ID

Epidemiology (92D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Predicting missing links via local information
• Identifying influential spreaders in complex networks based on gravity formula
• Identification of influential nodes in complex networks: method from spreading probability viewpoint
• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• Ranking hubs and authorities using matrix functions
• Relative degree structural hole centrality, \(\mathrm{C}_{\mathrm{RD-SH}}\): a new centrality measure in complex networks
• Identifying influential spreaders in artificial complex networks
• The centrality index of a graph
• Collective dynamics of ‘small-world’ networks
• A Computer Method for Calculating Kendall's Tau with Ungrouped Data

This page was built for publication: Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths