Robustness of Networks under Edge Attacks with Grey Information

From the perspective of information, random attack and malicious attack can be regarded as two extreme information, and the attack mode of more situations can be considered through grey information. In this paper, the edge attack is designed with the grey information on the network robustness. The edge attack mode under grey information is established, and the change of the network robustness is shown by the largest connected components and decomposed connected components. The results in scale-free (SF) networks and Erdös-Rényi (ER) networks indicate that attacks with different information in ER networks have little difference, while in SF networks, the difference of edge attacks under different grey information is more clearly reflected. Meanwhile, in the process of removing edges, edge attacks with smaller attack information accuracy parameters can make the network appear more decomposed components. The obtained results extend the impact of different attacks and are potentially valuable for designing more robust networks.