Optimizing Networks against Malicious Attacks
We study the robustness of diﬀerent types of networks under dynamic degree-based node attack (DDA). The DDA removes the node with the highest connectivity and recalculate the connectivity at each removal step.
We optimize numerically the network against this attack strategy, under the condition that the degree distribution remains constant. During the optimization process we calculate some properties of the network, like clustering coeﬃcient, assortativity, correlation, eﬃciency, robustness against random errors and robustness against other attack strategies to see what properties are important for robust networks. We ﬁnd that the robustness against a speciﬁc attack strategy can be improved dramatically.