Identifying the node spreading influence with largest \(k\)-core values

DOI10.1016/j.physleta.2014.09.054zbMath1301.05320OpenAlexW1965362147MaRDI QIDQ480268

Li-Ying Tang, Wen-Zhao Dong, Jian-Hong Lin, Qiang Guo, Jian-guo Liu

Publication date: 8 December 2014

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physleta.2014.09.054

Mathematics Subject Classification ID

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

Related Items (6)

Robustness of network of networks with interdependent and interconnected links ⋮ Investigating the relationship between \(k\)-core and \(s\)-core network decompositions ⋮ Identifying influential spreaders in complex networks based on gravity formula ⋮ Rank the spreading influence of nodes using dynamic Markov process ⋮ M-Centrality: identifying key nodes based on global position and local degree variation ⋮ Density centrality: identifying influential nodes based on area density formula

Cites Work

• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• Epidemic dynamics on complex networks
• The centrality index of a graph
• OPINION SPREADING AND CONSENSUS FORMATION ON SQUARE LATTICE
• Dynamical Processes on Complex Networks

This page was built for publication: Identifying the node spreading influence with largest \(k\)-core values