Robustness of scale-free networks under attack with tunable grey information
Institute for Cyber Security, University of Texas at San Antonio - San Antonio, TX 78249, USA
Accepted: 8 June 2011
We study the robustness of scale-free networks against attack with grey information, which means that one can obtain the information of all nodes, but the attack information may be imprecise. The known random failure and intentional attack are two extreme scenarios of our robustness model. By introducing two attack information parameters α and β, where α governs negative deviation of one's observation while β governs positive deviation of the observation, we demonstrate tunable equilibrium of degree, which accommodates abundant observation mechanisms. We derive the exact solution of the critical removal fraction of nodes for the disintegration of networks. Increasing the precision of attack information can reduce the robustness of scale-free networks. Our main finding is that the attack robustness of scale-free networks is more sensitive to the parameter α than to the parameter β. Moreover, if α and β for a node having degree k are proportional to kγ, where − ∞<γ<+∞, we find that increasing γ enhances the robustness of scale-free networks when γ> 0 and that the network seems rather fragile for any γ<0. Our model provides insight into the investigation of attack and defence strategies of complex networks.
PACS: 89.75.Hc – Networks and genealogical trees / 89.75.Fb – Structures and organization in complex systems / 89.75.Da – Systems obeying scaling laws
© EPLA, 2011