Vulnerability of complex networks under intentional attack with incomplete information

DOI10.1088/1751-8113/40/11/005zbMath1137.94377OpenAlexW2029226568MaRDI QIDQ3435132

Dazhi Zhu, Jun Wu, Hongzhong Deng, Yue-jin Tan

Publication date: 25 April 2007

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1751-8113/40/11/005

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Authentication, digital signatures and secret sharing (94A62)

Related Items (16)

Optimal attack strategy of complex networks based on tabu search ⋮ Optimization of cascading failure on complex network based on NNIA ⋮ Efficient disintegration strategy in directed networks based on tabu search ⋮ Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them ⋮ Efficient network disruption under imperfect information: the sharpening effect of network reconstruction with no prior knowledge ⋮ Robustness of random graphs based on graph spectra ⋮ Some bounds for total communicability of graphs ⋮ Cascading failures in interdependent directed networks under localized attacks ⋮ Go-Index: Applying Supply Networks Principles as Internet Robustness Metrics ⋮ Structural robustness of combat networks of weapon system-of-systems based on the operation loop ⋮ Exploring the “Middle Earth” of network spectra via a Gaussian matrix function ⋮ Accounting for the role of long walks on networks via a new matrix function ⋮ Damage attack on complex networks ⋮ Multi-node attack strategy of complex networks due to cascading breakdown ⋮ Attack and defense strategies in complex networks based on game theory ⋮ Robustness of regular ring lattices based on natural connectivity

This page was built for publication: Vulnerability of complex networks under intentional attack with incomplete information