Optimal Design on Robustness of Scale-Free Networks Based on Degree Distribution

Abstract EN

This paper uses 2-norm degree and coefficient of variation on degree to analyze the basic characteristics and to discuss the robustness of scale-free networks.

And we design two optimal nonlinear mixed integer programming schemes to investigate the optimal robustness and analyze the characteristic parameters of different schemes.

In this paper, we can obtain the optimal values of the corresponding parameters of optimal designs, and we find that coefficient of variation is a better measure than 2-norm degree and two-step degree to study the robustness of scale-free networks.

Meanwhile, we discover that there is a tradeoff among the robustness, the degree, and the cost of scale-free networks, and we find that when average degree equals 6, this point is a tradeoff point between the robustness and cost of scale-free networks.