OPTIMIZATION OF ROBUSTNESS OF SCALE-FREE NETWORK TO RANDOM AND TARGETED ATTACKS

DOI10.1142/S0217984905008773MaRDI QIDQ5699321zbMATH OpenOpenAlexFDO

Authors Zhongtuo Wang, Yanzhong Dang, Jian-guo Liu

Publication date 26 October 2005

Published in Modern Physics Letters B (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0506699

zbMATH Keywords

optimal programmepower-law distributionrandom failureScale-free network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Communication networks in operations research (90B18)

Abstract: The scale-fee networks, having connectivity distribution $P(k)sim{k}^{-alpha}$ (where $k$ is the site connectivity), is very resilient to random failures but fragile to intentional attack. The purpose of this paper is to find the network design guideline which can make the robustness of the network to both random failures and intentional attack maximum while keeping the average connectivity $<k>$ per node constant. We find that when $<k>=3$ the robustness of the scale-free networks reach its maximum value if the minimal connectivity $m=1$, but when $<k>$ is larger than four, the networks will become more robust to random failures and targeted attacks as the minimal connectivity $m$ gets larger.

Recommendations

• OPTIMIZATION OF SCALE-FREE NETWORK FOR RANDOM FAILURES
• Enhance robustness of scale-free networks
• Enhancing the robustness of scale-free networks
• Tabu search enhances network robustness under targeted attacks
• Principles of Distributed Systems

Cites work

• Collective dynamics of `small-world' networks
• Famous trails to Paul Erdős. With a sidebar by Paul M. B. Vitanyi.
• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks

Cited in

(25)

• Network robustness and random processes
• Tabu search enhances network robustness under targeted attacks
• False positive and false negative effects on network attacks
• Exponential random graph models for networks resilient to targeted attacks
• Efficient disintegration strategy in directed networks based on tabu search
• Efficient network disruption under imperfect information: the sharpening effect of network reconstruction with no prior knowledge
• Dynamical resilience of networks against targeted attack
• Generalized \(k\)-cores of networks under attack with limited knowledge
• Robustness of scale-free networks with dynamical behavior against multi-node perturbation
• Attack and defense strategies in complex networks based on game theory
• Effects of the high-order correlation on information filtering
• Optimizing network topology for cascade resilience
• Study on indices of network structure robustness and their application
• Exploiting the robustness on power-law networks
• Robustness of power-law networks: its assessment and optimization
• ROBUSTNESS IN SCALE-FREE NETWORKS: COMPARING DIRECTED AND UNDIRECTED NETWORKS
• Enhancing the robustness of scale-free networks
• Robustness and Vulnerability of Scale-Free Random Graphs
• EFFECT OF ATTACK ON SCALE-FREE NETWORKS DUE TO CASCADING FAILURE
• Epidemic dynamics on random and scale-free networks
• Entropy optimization on scale-free networks' resilience
• Enhance robustness of scale-free networks
• OPTIMIZATION OF SCALE-FREE NETWORK FOR RANDOM FAILURES
• Principles of Distributed Systems
• Network robustness to targeted attacks. The interplay of expansibility and degree distribution

This page was built for publication: OPTIMIZATION OF ROBUSTNESS OF SCALE-FREE NETWORK TO RANDOM AND TARGETED ATTACKS

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