Related papers: Cascading Failures in Networks with Proximate Depe…
Random Threshold Networks with sparse, asymmetric connections show complex dynamical behavior similar to Random Boolean Networks, with a transition from ordered to chaotic dynamics at a critical average connectivity $K_c$. In this type of…
Percolation and synchronization are two phase transitions that have been extensively studied since already long ago. A classic result is that, in the vast majority of cases, these transitions are of the second-order type, i.e. continuous…
Complex systems are challenging to control because the system responds to the controller in a nonlinear fashion, often incorporating feedback mechanisms. Interdependence of systems poses additional difficulties, as cross-system connections…
Different from the direct contact in epidemics spread, overload failures propagate through hidden functional dependencies. Many studies focused on the critical conditions and catastrophic consequences of cascading failures. However, to…
We study the statistical properties of large random networks with specified degree distributions. New techniques are presented for analyzing the structure of social networks. Specifically, we address the question of how many nodes exist at…
Modern world builds on the resilience of interdependent infrastructures characterized as complex networks. Recently, a framework for analysis of interdependent networks has been developed to explain the mechanism of resilience in…
This article is a mini-review about electrical current flows in networks from the perspective of statistical physics. We briefly discuss analytical methods to solve the conductance of an arbitrary resistor network. We then turn to basic…
Large scale networks delineating collective dynamics often exhibit cascading failures across nodes leading to a system-wide collapse. Prominent examples of such phenomena would include collapse on financial and economic networks.…
We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation…
We analyze cascades of defaults in an interbank loan market. The novel feature of this study is that the network structure and the size distribution of banks are derived from empirical data. We find that the ability of a defaulted…
Cascades on random networks are typically analyzed by assuming they map onto percolation processes and then are solved using generating function formulations. This approach assumes that the network is infinite and weakly connected, yet…
Explosive percolation in a network is a phase transition where a large portion of nodes becomes connected with an addition of a small number of edges. Although extensively studied in random network models and reconstructed real networks,…
The vulnerability of an isolated network to cascades is fundamentally affected by its interactions with other networks. Motivated by failures cascading among electrical grids, we study the Bak-Tang-Wiesenfeld sandpile model on two…
The study of interdependent networks, and in particular the robustness on networks, has attracted considerable attention. Recent studies mainly assume that the dependence is fully interdependent. However, targeted attack for partially…
The increased complexity of infrastructure systems has resulted in critical interdependencies between multiple networks---communication systems require electricity, while the normal functioning of the power grid relies on communication…
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…
In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson clustered…
One of the main issues in modern network science is the phenomenon of cascading failures of a small number of attacks. Here we define the dimension of a network to be the maximal number of functions or features of nodes of the network. It…
Modular networks, such as critical infrastructures, are often built from distinct, densely connected modules (e.g., cities) that are sparsely interconnected. When such networks are gradually and randomly disrupted under a percolation…
We investigate the growth of connectivity in a network. In our model, starting with a set of disjoint nodes, links are added sequentially. Each link connects two nodes, and the connection rate governing this random process is proportional…