Abstract

In this paper, adopting the initial load of a node j to be [Formula: see text], where kj is the degree of the node j and α is a tunable parameter that controls the strength of the initial load of a node, we propose a cascading model with a breakdown probability and explore cascading failures on a typical network, i.e., the Barabási–Albert (BA) network with scale-free property. Assume that a failed node leads only to a redistribution of the load passing through it to its neighboring nodes. According to the simulation results, we find that BA networks reach the strongest robustness level against cascading failures when α = 1 and the robustness of networks has a positive correlation with the average degree 〈k〉, not relating to the different breakdown probabilities. In addition, it is found that the robustness against cascading failures has an inversely proportional relationship with the breakdown probability of an overload node. Finally, the numerical simulations are verified by the theoretical analysis.

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 call

Disclaimer: 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.