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

DOI10.1063/1.5141153MaRDI QIDQ5129871zbMATH OpenOpenAlexWikidataFDO

Authors Ming-Yang Zhou, Juntao Tan, Hao Liao, Ziming Wang, 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

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

Recommendations

• Generalized network dismantling
• Method of social network dismantling based on neighbor nodes fusion
• Fragmenting complex network based on non-backtracking matrix
• Efficient network dismantling via node explosive percolation
• A fast greedy algorithm for the critical node detection problem

Cites work

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

Cited in

(6)

• Efficient disintegration strategy in directed networks based on tabu search
• Method of social network dismantling based on neighbor nodes fusion
• Efficient network dismantling via node explosive percolation
• Generalized network dismantling
• Fragmenting complex network based on non-backtracking matrix
• Rank the spreading influence of nodes using dynamic Markov process

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5129871)