Dismantling complex networks based on the principal eigenvalue of the adjacency matrix

DOI10.1063/1.5141153zbMath1445.05003OpenAlexW3047005020WikidataQ98886370 ScholiaQ98886370MaRDI QIDQ5129871

Juntao Tan, Ming-Yang Zhou, Ziming Wang, Hao Liao, Rui Mao

Publication date: 2 November 2020

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1063/1.5141153

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Computational methods for problems pertaining to combinatorics (05-08)

Related Items (1)

Rank the spreading influence of nodes using dynamic Markov process

Cites Work

• Identifying and ranking influential spreaders in complex networks by neighborhood coreness
• Ranking in evolving complex networks
• Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
• Spectral properties of complex networks
• Analytical connection between thresholds and immunization strategies of SIS model in random networks

This page was built for publication: Dismantling complex networks based on the principal eigenvalue of the adjacency matrix