Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition
DOI10.1016/j.physleta.2018.05.032zbMath1405.91527OpenAlexW2807767179WikidataQ129700181 ScholiaQ129700181MaRDI QIDQ1632565
Yanqiang Xu, Yi Zhang, Fan Yang, Xiangwei Li, Yabing Yao, Jundi Wang, Ruisheng Zhang, Xin-hui Liu
Publication date: 14 December 2018
Published in: Physics Letters. A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physleta.2018.05.032
complex networksextended weighted degree (EWD) centralityremaining minimum degree (RMD) decompositionspreading influence of nodessusceptible-infectious-recovered (SIR) model
Social networks; opinion dynamics (91D30) Deterministic network models in operations research (90B10)
Related Items (3)
Cites Work
- Some discrete-time SI, SIR, and SIS epidemic models
- Identifying influential spreaders in complex networks based on gravity formula
- Identification of influential nodes in complex networks: method from spreading probability viewpoint
- A new evidential methodology of identifying influential nodes in complex networks
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- Ranking the spreading ability of nodes in complex networks based on local structure
- A new measure of identifying influential nodes: efficiency centrality
- Identifying influential nodes in complex networks based on AHP
- A new model for capturing the spread of computer viruses on complex-networks
- A faster algorithm for betweenness centrality*
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Collective dynamics of ‘small-world’ networks
- A NEW MEASURE OF RANK CORRELATION
This page was built for publication: Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition