Abstract
Many real-world systems can be described by scale-free networks with power-law degree distributions. Scale-free networks show a “robust yet fragile” feature due to their heterogeneous degree distributions. We propose to enhance the structural robustness of scale-free networks against intentional attacks by changing the displayed network structure information rather than modifying the network structure itself. We first introduce a simple mathematical model for attack information and investigate the impact of attack information on the structural robustness of scale-free networks. Both analytical and numerical results show that decreasing slightly the attack information perfection by information disturbance can dramatically enhance the structural robustness of scale-free networks. Then we propose an optimization model of disturbance strategies in which the cost constraint is considered. We analyze the optimal disturbance strategies and show an interesting but counterintuitive finding that disturbing “poor nodes” with low degrees preferentially is more effective than disturbing “rich nodes” with high degrees preferentially. We demonstrate the efficiency of our method by comparison with edge addition method and validate the feasibility of our method in two real-world critical infrastructure networks.
Highlights
IntroductionBecause of its broad applications, the structural robustness of complex networks has received increasing attention, especially from the original work by Albert et al.[17]
Albert et al suggested that scale-free networks characterized by a highly heterogeneous degree distribution are robust against random failure but are very fragile against intentional attack
It inspires us to consider enhancing the structural robustness against intentional attacks by changing the displayed network structure information rather than modifying the network structure itself
Summary
Because of its broad applications, the structural robustness of complex networks has received increasing attention, especially from the original work by Albert et al.[17] They introduced two attack strategies, i.e., random failure and intentional attack. Albert et al suggested that scale-free networks characterized by a highly heterogeneous degree distribution are robust against random failure but are very fragile against intentional attack. This property is referred to as the “robust yet fragile” feature or the Achilles’ heel of scale-free networks by Doyle et al.[18, 19]. To the best of our knowledge, this idea is new
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
