Related papers: Strategy for stopping failure cascades in interdep…
Modern networks are becoming increasingly interdependent. As a prominent example, the smart grid is an electrical grid controlled through a communications network, which in turn is powered by the electrical grid. Such interdependencies…
The collapse of interdependent networks, as well as similar avalanche phenomena, is driven by cascading failures. At the critical point, the cascade begins as a critical branching process, where each failing node (element) triggers, on…
We investigate the abrupt breakdown behavior of coupled distribution grids under load growth. This scenario mimics the ever-increasing customer demand and the foreseen introduction of energy hubs interconnecting the different energy…
With the sharp increase of power demand, large-scale blackouts in power grids occur frequently around the world. Cascading failures are the main causes of network outages. Therefore, revealing the complicated cascade mechanism in grids is…
We present analytic and numeric results for percolation in a network formed of interdependent spatially embedded networks. We show results for a treelike and a random regular network of networks each with $(i)$ unconstrained interdependent…
The dynamics of cascading activation, such as rapid changes in public opinion and the outbreak of disease epidemics, have a crucial dependence on the connectivity patterns among the agents. We study cascading dynamics in modular,…
Recently, there has been a growing concern about the overload status of the power grid networks, and the increasing possibility of cascading failures. Many researchers have studied these networks to provide design guidelines for more robust…
We study the cascading failure of networks due to overload, using the betweenness centrality of a node as the measure of its load following the Motter and Lai model. We study the fraction of survived nodes at the end of the cascade $p_f$ as…
How the giant component of a network disappears under attacking nodes or links addresses a key aspect of network robustness, which can be framed into percolation problems. Various strategies to select the node to be deactivated have been…
We study the role of fluctuations in percolation of sparse complex networks. To this end we consider two random correlated realizations of the initial damage of the nodes and we evaluate the fraction of nodes that are expected to remain in…
A concept of bypass rewiring is introduced and random bypass rewiring is analytically and numerically investigated with simulations. Our results show that bypass rewiring makes networks robust against removal of nodes including random…
Simulating potential cascading failures can be useful for avoiding or mitigating such events. Currently, existing steady-state analysis tools are ill-suited for simulating cascading outages as they do not model frequency dependencies, they…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…
In the context of epidemic spreading, many intricate dynamical patterns can emerge due to the cooperation of different types of pathogens or the interaction between the disease spread and other failure propagation mechanism. To unravel such…
In this work, we propose a control scheme for power grids subject to large perturbations that cause the failure of a node of the grid. Under such circumstances, the system may lose synchrony and, in addition, a cascade of line failures can…
Link failures in supply networks can have catastrophic consequences that can lead to a complete collapse of the network. Strategies to prevent failure spreading are thus heavily sought after. Here, we make use of a spanning tree formulation…
We examine the heterogeneous responses of individual nodes in sparse networks to the random removal of a fraction of edges. Using the message-passing formulation of percolation, we discover considerable variation across the network in the…
Interdependent networks have been shown to be extremely vulnerable based on the percolation model. Parshani et. al further indicated that the more inter-similar networks are, the more robust they are to random failure. Our understanding of…
We model the robustness against random failure or intentional attack of networks with arbitrary large-scale structure. We construct a block-based model which incorporates --- in a general fashion --- both connectivity and interdependence…