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

DOI10.1142/S0217984905008773zbMATH Open1078.90017arXivcond-mat/0506699OpenAlexW3104857439MaRDI QIDQ5699321FDOQ5699321

Zhongtuo Wang, Jian-guo Liu, Yanzhong Dang

Publication date: 26 October 2005

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

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.

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

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

zbMATH Keywords

power-law distributionrandom failureoptimal programmeScale-free network

Mathematics Subject Classification ID

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

Cites Work

• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• Collective dynamics of ‘small-world’ networks
• Title not available (Why is that?)
• Famous trails to Paul Erdős. With a sidebar by Paul M. B. Vitanyi.

Cited In (13)

• Principles of Distributed Systems
• Network robustness to targeted attacks. The interplay of expansibility and degree distribution
• Tabu search enhances network robustness under targeted attacks
• Exponential random graph models for networks resilient to targeted attacks
• Network robustness and random processes
• Attack and defense strategies in complex networks based on game theory
• Dynamical resilience of networks against targeted attack
• Efficient disintegration strategy in directed networks based on tabu search
• Effects of the high-order correlation on information filtering
• EPIDEMIC DYNAMICS ON RANDOM AND SCALE-FREE NETWORKS
• EFFECT OF ATTACK ON SCALE-FREE NETWORKS DUE TO CASCADING FAILURE
• Robustness and Vulnerability of Scale-Free Random Graphs
• Efficient network disruption under imperfect information: the sharpening effect of network reconstruction with no prior knowledge

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)