Identification of influential nodes in complex networks: method from spreading probability viewpoint
From MaRDI portal
Publication:1620311
DOI10.1016/j.physa.2016.10.086zbMath1400.90055OpenAlexW2548124216MaRDI QIDQ1620311
Chuang Ma, Zhong-Kui Bao, Bing-Bing Xiang, Hai-feng Zhang
Publication date: 13 November 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2016.10.086
Epidemiology (92D30) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10)
Related Items (2)
Identifying influential spreaders in complex networks by considering the impact of the number of shortest paths ⋮ Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition
Cites Work
- Predicting missing links via local information
- Identifying influential spreaders in complex networks based on gravity formula
- Identifying and ranking influential spreaders in complex networks by neighborhood coreness
- The centrality index of a graph
- Emergence of Scaling in Random Networks
- Collective dynamics of ‘small-world’ networks
- A Computer Method for Calculating Kendall's Tau with Ungrouped Data
This page was built for publication: Identification of influential nodes in complex networks: method from spreading probability viewpoint