Binary Information Press
In this paper, the authors consider the robustness of weighted complex networks against cascading failures. They propose a betweenness-dependent node weighting method and construct a cascading model by applying the local weighted flow redistribution rule. The cascading failures triggered by small node attacks are studied numerically and theoretically for four typical complex networks. The results show that all studied networks in which the weight of each node is its betweenness reach the strongest robustness level. Furthermore, the strategy in which the weights are assigned as the betweennesses makes the networks more robust, as compared with the previous strategy in which the weights are assigned as the degrees, showing that the possibility of the occurrence of the cascading failure and the size of the cascade in case of occurrence are more reduced.