اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPercolation of Interdependent Networks with Inter-similarity
152
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Real data show that interdependent networks usually involve inter-similarity. Intersimilarity means that a pair of interdependent nodes have neighbors in both networks that are also interdependent (Parshani et al cite{PAR10B}). For example, the coupled world wide port network and the global airport network are intersimilar since many pairs of linked nodes (neighboring cities), by direct flights and direct shipping lines exist in both networks. Nodes in both networks in the same city are regarded as interdependent. If two neighboring nodes in one network depend on neighboring nodes in the another we call these links common links. The fraction of common links in the system is a measure of intersimilarity. Previous simulation results suggest that intersimilarity has considerable effect on reducing the cascading failures, however, a theoretical understanding on this effect on the cascading process is currently missing. Here, we map the cascading process with inter-similarity to a percolation of networks composed of components of common links and non common links. This transforms the percolation of inter-similar system to a regular percolation on a series of subnetworks, which can be solved analytically. We apply our analysis to the case where the network of common links is an ErdH{o}s-R{e}nyi (ER) network with the average degree $K$, and the two networks of non-common links are also ER networks. We show for a fully coupled pair of ER networks, that for any $Kgeq0$, although the cascade is reduced with increasing $K$, the phase transition is still discontinuous. Our analysis can be generalized to any kind of interdependent random networks system.
قيم البحث
اقرأ أيضاً
In many real network systems, nodes usually cooperate with each other and form groups, in order to enhance their robustness to risks. This motivates us to study a new type of percolation, group percolation, in interdependent networks under attacks. I
n this model, nodes belonging to the same group survive or fail together. We develop a theoretical framework for this novel group percolation and find that the formation of groups can improve the resilience of interdependent networks significantly. However, the percolation transition is always of first order, regardless of the distribution of group sizes. As an application, we map the interdependent networks with inter-similarity structures, which attract many attentions very recently, onto the group percolation and confirm the non-existence of continuous phase transitions.
Interdependent networks are ubiquitous in our society, ranging from infrastructure to economics, and the study of their cascading behaviors using percolation theory has attracted much attention in the recent years. To analyze the percolation phenomen
a of these systems, different mathematical frameworks have been proposed including generating functions, eigenvalues among some others. These different frameworks approach the phase transition behaviors from different angles, and have been very successful in shaping the different quantities of interest including critical threshold, size of the giant component, order of phase transition and the dynamics of cascading. These methods also vary in their mathematical complexity in dealing with interdependent networks that have additional complexity in terms of the correlation among different layers of networks or links. In this work, we review a particular approach of simple self-consistent probability equations, and illustrate that it can greatly simplify the mathematical analysis for systems ranging from single layer network to various different interdependent networks. We give an overview on the detailed framework to study the nature of the critical phase transition, value of the critical threshold and size of the giant component for these different systems.
The functionality of nodes in a network is often described by the structural feature of belonging to the giant component. However, when dealing with problems like transport, a more appropriate functionality criterion is for a node to belong to the ne
tworks backbone, where the flow of information and of other physical quantities (such as current) occurs. Here we study percolation in a model of interdependent resistor networks and show the effect of spatiality on their coupled functioning. We do this on a realistic model of spatial networks, featuring a Poisson distribution of link-lengths. We find that interdependent resistor networks are significantly more vulnerable than their percolation-based counterparts, featuring first-order phase transitions at link-lengths where the mutual giant component still emerges continuously. We explain this apparent contradiction by tracing the origin of the increased vulnerability of interdependent transport to the crucial role played by the dandling ends. Moreover, we interpret these differences by considering an heterogeneous $k$-core percolation process which enables to define a one-parameter family of functionality criteria whose constraints become more and more stringent. Our results highlight the importance that different definitions of nodes functionality have on the collective properties of coupled processes, and provide better understanding of the problem of interdependent transport in many real-world networks.
Interdependencies are ubiquitous throughout the world. Every real-world system interacts with and is dependent on other systems, and this interdependency affects their performance. In particular, interdependencies among networks make them vulnerable
to failure cascades, the effects of which are often catastrophic. Failure propagation fragments network components, disconnects them, and may cause complete systemic failure. We propose a strategy of avoiding or at least mitigating the complete destruction of a system of interdependent networks experiencing a failure cascade. Starting with a fraction $1-p$ of failing nodes in one network, we reconnect with a probability $gamma$ every isolated component to a functional giant component (GC), the largest connected cluster. We find that as $gamma$ increases the resilience of the system to cascading failure also increases. We also find that our strategy is more effective when it is applied in a network of low average degree. We solve the problem theoretically using percolation theory, and we find that the solution agrees with simulation results.
Cascading failures in complex systems have been studied extensively using two different models: $k$-core percolation and interdependent networks. We combine the two models into a general model, solve it analytically and validate our theoretical resul
ts through extensive simulations. We also study the complete phase diagram of the percolation transition as we tune the average local $k$-core threshold and the coupling between networks. We find that the phase diagram of the combined processes is very rich and includes novel features that do not appear in the models studying each of the processes separately. For example, the phase diagram consists of first and second-order transition regions separated by two tricritical lines that merge together and enclose a novel two-stage transition region. In the two-stage transition, the size of the giant component undergoes a first-order jump at a certain occupation probability followed by a continuous second-order transition at a lower occupation probability. Furthermore, at certain fixed interdependencies, the percolation transition changes from first-order $rightarrow$ second-order $rightarrow$ two-stage $rightarrow$ first-order as the $k$-core threshold is increased. The analytic equations describing the phase boundaries of the two-stage transition region are set up and the critical exponents for each type of transition are derived analytically.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
