Optimization of robustness of scale-free network to random and targeted attacks
Jian-Guo Liu, Zhong-Tuo Wang, Yan-Zhong Dang

TL;DR
This paper investigates how to optimize the robustness of scale-free networks against both random failures and targeted attacks by adjusting minimal connectivity, providing guidelines for resilient network design.
Contribution
It introduces a network design strategy to maximize robustness of scale-free networks under different failure scenarios while maintaining constant average connectivity.
Findings
Maximum robustness at <k>=3 with minimal connectivity m=1
Robustness improves as m increases when <k> > 4
Guidelines for designing resilient scale-free networks
Abstract
The scale-fee networks, having connectivity distribution (where 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 per node constant. We find that when the robustness of the scale-free networks reach its maximum value if the minimal connectivity , but when is larger than four, the networks will become more robust to random failures and targeted attacks as the minimal connectivity gets larger.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
