Abstract
According to the dynamical characteristics of the local redistribution of the load on a removal node, by the reconnection of the neighboring edge of the most vulnerable node, we propose an effective method to improve the network robustness against cascading failures. Under two constraints, i.e. keeping the degree of each node unchanged and fixing the total protective cost of a network, we investigate the efficiency of the swap method on scale-free networks and analyze the correlation between the optimized network and the Pearson correlation coefficient. We numerically show that effective swapping of the small part of connections can dramatically improve the network robust level against cascading failures and find that the optimized networks obtained by the swap method exhibit an extremely disassortative degree–degree correlation, that is, the disassortativity decreases the robustness of the optimized network against cascading failures. While the extent of the disassortative mixing is decided by the parameters in the cascading model. In addition, we also compare the average path length and the diameter of the optimized and the original networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
