Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTriple point induced by targeted autonomization on interdependent scale free networks
169
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Many man-made networks support each other to provide efficient services and resources to the customers, despite that this support produces a strong interdependency between the individual networks. Thus an initial failure of a fraction $1-p$ of nodes in one network, exposes the system to cascade of failures and, as a consequence, to a full collapse of the overall system. Therefore it is important to develop efficient strategies to avoid the collapse by increasing the robustness of the individual networks against failures. Here, we provide an exact theoretical approach to study the evolution of the cascade of failures on interdependent networks when a fraction $alpha$ of the nodes with higher connectivity in each individual network are autonomous. With this pattern of interdependency we found, for pair of heterogeneous networks, two critical percolation thresholds that depend on $alpha$, separating three regimes with very different networks final sizes that converge into a triple point in the plane $p-alpha$. Our findings suggest that the heterogeneity of the networks represented by high degree nodes is the responsible of the rich phase diagrams found in this and other investigations.
rate research
Read More
Many real-world networks depend on other networks, often in non-trivial ways, to maintain their functionality. These interdependent networks of networks are often extremely fragile. When a fraction $1-p$ of nodes in one network randomly fails, the damage propagates to nodes in networks that are interdependent and a dynamic failure cascade occurs that affects the entire system. We present dynamic equations for two interdependent networks that allow us to reproduce the failure cascade for an arbitrary pattern of interdependency. We study the rich club effect found in many real interdependent network systems in which the high-degree nodes are extremely interdependent, correlating a fraction $alpha$ of the higher degree nodes on each network. We find a rich phase diagram in the plane $p-alpha$, with a triple point reminiscent of the triple point of liquids that separates a non-functional phase from two functional phases.
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 interdependent networks. Here we extend this interdependent network model by considering flows in the networks and study the systems resilience under different attack strategies. In our model, nodes may fail due to either overload or loss of interdependency. Under the interaction between these two failure mechanisms, it is shown that interdependent scale-free networks show extreme vulnerability. The resilience of interdependent SF networks is found in our simulation much smaller than single SF network or interdependent SF networks without flows.
Taking into account the fact that overload failures in real-world functional networks are usually caused by extreme values of temporally fluctuating loads that exceed the allowable range, we study the robustness of scale-free networks against cascading overload failures induced by fluctuating loads. In our model, loads are described by random walkers moving on a network and a node fails when the number of walkers on the node is beyond the node capacity. Our results obtained by using the generating function method shows that scale-free networks are more robust against cascading overload failures than ErdH{o}s-Renyi random graphs with homogeneous degree distributions. This conclusion is contrary to that predicted by previous works which neglect the effect of fluctuations of loads.
Recent network research has focused on the cascading failures in a system of interdependent networks and the necessary preconditions for system collapse. An important question that has not been addressed is how to repair a failing system before it suffers total breakdown. Here we introduce a recovery strategy of nodes and develop an analytic and numerical framework for studying the concurrent failure and recovery of a system of interdependent networks based on an efficient and practically reasonable strategy. Our strategy consists of repairing a fraction of failed nodes, with probability of recovery $gamma$, that are neighbors of the largest connected component of each constituent network. We find that, for a given initial failure of a fraction $1-p$ of nodes, there is a critical probability of recovery above which the cascade is halted and the system fully restores to its initial state and below which the system abruptly collapses. As a consequence we find in the plane $gamma-p$ of the phase diagram three distinct phases. A phase in which the system never collapses without being restored, another phase in which the recovery strategy avoids the breakdown, and a phase in which even the repairing process cannot avoid the system collapse.
We bring rigor to the vibrant activity of detecting power laws in empirical degree distributions in real-world networks. We first provide a rigorous definition of power-law distributions, equivalent to the definition of regularly varying distributions that are widely used in statistics and other fields. This definition allows the distribution to deviate from a pure power law arbitrarily but without affecting the power-law tail exponent. We then identify three estimators of these exponents that are proven to be statistically consistent -- that is, converging to the true value of the exponent for any regularly varying distribution -- and that satisfy some additional niceness requirements. In contrast to estimators that are currently popular in network science, the estimators considered here are based on fundamental results in extreme value theory, and so are the proofs of their consistency. Finally, we apply these estimators to a representative collection of synthetic and real-world data. According to their estimates, real-world scale-free networks are definitely not as rare as one would conclude based on the popular but unrealistic assumption that real-world data comes from power laws of pristine purity, void of noise and deviations.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
