RESUMO
We study the cascading traffic jamming on a two-dimensional random geometric graph using the Motter and Lai model. The traffic jam is caused by a localized attack incapacitating a circular region or a line of a certain size, as well as a dispersed attack on an equal number of randomly selected nodes. We investigate if there is a critical size of the attack above which the network becomes completely jammed due to cascading jamming, and how this critical size depends on the average degree ãkã of the graph, on the number of nodes N in the system, and the tolerance parameter α of the Motter and Lai model.
RESUMO
Carreras, Dobson, and colleagues have studied empirical data on the sizes of the blackouts in real grids and modeled them with computer simulations using the direct current approximation. They have found that the resulting blackout sizes are distributed as a power law and suggested that this is because the grids are driven to the self-organized critical state. In contrast, more recent studies found that the distribution of cascades is bimodal resulting in either a very small blackout or a very large blackout, engulfing a finite fraction of the system. Here we reconcile the two approaches and investigate how the distribution of the blackouts changes with model parameters, including the tolerance criteria and the dynamic rules of failure of the overloaded lines during the cascade. In addition, we study the same problem for the Motter and Lai model and find similar results, suggesting that the physical laws of flow on the network are not as important as network topology, overload conditions, and dynamic rules of failure.
RESUMO
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 a function of the strength of the initial attack, measured by the fraction of nodes p that survive the initial attack for different values of tolerance α in random regular and Erdös-Renyi graphs. We find the existence of a first-order phase-transition line p_{t}(α) on a p-α plane, such that if p
RESUMO
We study the mutual percolation of two interdependent lattice networks ranging from two to seven dimensions, denoted as D. We impose that the length (measured as chemical distance) of interdependency links connecting nodes in the two lattices be less than or equal to a certain value, r. For each value of D and r, we find the mutual percolation threshold, p_{c}[D,r], below which the system completely collapses through a cascade of failures following an initial destruction of a fraction (1-p) of the nodes in one of the lattices. We find that for each dimension, D<6, there is a value of r=r_{I}>1 such that for r≥r_{I} the cascading failures occur as a discontinuous first-order transition, while for r
RESUMO
We study the mutual percolation of a system composed of two interdependent random regular networks. We introduce a notion of distance to explore the effects of the proximity of interdependent nodes on the cascade of failures after an initial attack. We find a nontrivial relation between the nature of the transition through which the networks disintegrate and the parameters of the system, which are the degree of the nodes and the maximum distance between interdependent nodes. We explain this relation by solving the problem analytically for the relevant set of cases. In the process, we solve a variant of Rényi's parking problem on treelike graphs.
RESUMO
We study a problem of failure of two interdependent networks in the case of identical degrees of mutually dependent nodes. We assume that both networks (A and B) have the same number of nodes N connected by the bidirectional dependency links establishing a one-to-one correspondence between the nodes of the two networks in a such a way that the mutually dependent nodes have the same number of connectivity links; i.e., their degrees coincide. This implies that both networks have the same degree distribution P(k). We call such networks correspondently coupled networks (CCNs). We assume that the nodes in each network are randomly connected. We define the mutually connected clusters and the mutual giant component as in earlier works on randomly coupled interdependent networks and assume that only the nodes that belong to the mutual giant component remain functional. We assume that initially a 1-p fraction of nodes are randomly removed because of an attack or failure and find analytically, for an arbitrary P(k), the fraction of nodes µ(p) that belong to the mutual giant component. We find that the system undergoes a percolation transition at a certain fraction p=p(c), which is always smaller than p(c) for randomly coupled networks with the same P(k). We also find that the system undergoes a first-order transition at p(c)>0 if P(k) has a finite second moment. For the case of scale-free networks with 2<λ≤3, the transition becomes a second-order transition. Moreover, if λ<3, we find p(c)=0, as in percolation of a single network. For λ=3 we find an exact analytical expression for p(c)>0. Finally, we find that the robustness of CCN increases with the broadness of their degree distribution.
RESUMO
Spatial intensity correlations between waves transmitted through random media are analyzed within the framework of the random matrix theory of transport. Assuming that the statistical distribution of transfer matrices is isotropic, we found that the spatial correlation function can be expressed as the sum of three terms, with distinctive spatial dependences. This result coincides with the one obtained in the diffusive regime from perturbative calculations, but holds all the way from quasiballistic transport to localization. While correlations are positive in the diffusive regime, we predict a transition to negative correlations as the length of the system decreases.