اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGroup percolation in interdependent networks
69
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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. In 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.
قيم البحث
اقرأ أيضاً
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 da
mage 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.
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.
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 coupl
ed 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.
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.
Many real-world networks are coupled together to maintain their normal functions. Here we study the robustness of multiplex networks with interdependent and interconnected links under k-core percolation, where a node fails when it connects to a thres
hold of less than k neighbors. By deriving the self-consistency equations, we solve the key quantities of interests such as the critical threshold and size of the giant component analytically and validate the theoretical results with numerical simulations. We find a rich phase transition phenomenon as we tune the inter-layer coupling strength. Specifically speaking, in the ER-ER multiplex networks, with the increase of coupling strength, the size of the giant component in each layer first undergoes a first-order transition and then a second-order transition and finally a first-order transition. This is due to the nature of inter-layer links with both connectivity and dependency simultaneously. The system is more robust if the dependency on the initial robust network is strong and more vulnerable if the dependency on the initial attacked network is strong. These effects are even amplified in the cascading process. When applying our model to the SF-SF multiplex networks, the type of transition changes. The system undergoes a first-order phase transition first only when the two layers mutually coupling is very strong and a second-order transition in other conditions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
