Identifying influential spreaders by weight degree centrality in complex networks

DOI10.1016/J.CHAOS.2016.01.030zbMath1382.91067OpenAlexW2289334527WikidataQ57852359 ScholiaQ57852359MaRDI QIDQ508182

Fuyuan Xiao, Yong Deng, Yuxian Du, Bo Wei, Yang Liu

Publication date: 10 February 2017

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.chaos.2016.01.030

zbMATH Keywords

complex networksassortativityinfluential spreadersweight degree centrality method

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (6)

Dynamic malware containment under an epidemic model with alert ⋮ Identifying influential spreaders in complex networks based on improved k-shell method ⋮ Epidemic spreading over quenched networks with local behavioral response ⋮ Dynamics in affinity-weighted preferential attachment networks ⋮ Identifying influential spreaders based on edge ratio and neighborhood diversity measures in complex networks ⋮ Rumor propagation controlling based on finding important nodes in complex network

Cites Work

• Unnamed Item
• Immunization strategy based on the critical node in percolation transition
• Mean field theory of epidemic spreading with effective contacts on networks
• Adequate is better: particle swarm optimization with limited-information
• Optimal step-size of pseudo affine projection algorithm
• Statistical convergence behavior of affine projection algorithms
• Betweenness in time dependent networks
• An evidential opinion dynamics model based on heterogeneous social influential power
• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• Ranking the spreading ability of nodes in complex networks based on local structure
• Identifying influential spreaders by weighted leaderrank
• Collective dynamics of ‘small-world’ networks
• A Computer Method for Calculating Kendall's Tau with Ungrouped Data
• THE TREATMENT OF TIES IN RANKING PROBLEMS

This page was built for publication: Identifying influential spreaders by weight degree centrality in complex networks