Network robustness to targeted attacks. The interplay of expansibility and degree distribution

DOI10.1140/EPJB/E2006-00330-7MaRDI QIDQ978910zbMATH OpenOpenAlexFDO

Authors J. Martínez

Publication date 25 June 2010

Published in The European Physical Journal B. Condensed Matter and Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1140/epjb/e2006-00330-7

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• OPTIMIZATION OF ROBUSTNESS OF SCALE-FREE NETWORK TO RANDOM AND TARGETED ATTACKS
• Robustness of networks formed from interdependent correlated networks under intentional attacks
• Exponential random graph models for networks resilient to targeted attacks
• Dynamical resilience of networks against targeted attack
• The vertex attack tolerance of complex networks

Cites work

• scientific article; zbMATH DE number 2115090 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Community structure in social and biological networks
• Eigenspaces of graphs
• Emergence of Scaling in Random Networks
• Exploring complex networks
• Isoperimetric numbers of graphs
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks

Cited in

(16)

• Graphs (networks) with golden spectral ratio
• Synchronizing network systems in the presence of limited resources via edge snapping
• The all-pairs vitality-maximization (VIMAX) problem
• Exponential random graph models for networks resilient to targeted attacks
• The limit of targeting in networks
• Network robustness and random processes
• Reducing the vulnerability of network by inserting modular topologies
• Dynamical resilience of networks against targeted attack
• Robustness of regular ring lattices based on natural connectivity
• A scoring mechanism for the rank aggregation of network robustness
• Go-index: applying supply networks principles as Internet robustness metrics
• Network topology vulnerability/cost trade-off: model, application, and computational complexity
• Robustness of random graphs based on graph spectra
• A note on the graph's resolvent and the multifilar structure
• Structural vulnerability and robustness in complex networks: different approaches and relationships between them
• Optimizing network robustness by edge rewiring: a general framework

This page was built for publication: Network robustness to targeted attacks. The interplay of expansibility and degree distribution

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