اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Simplified Self-Consistent Probabilities Framework to Characterize Percolation Phenomena on Interdependent Networks : An Overview
221
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 phenomena 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.
قيم البحث
اقرأ أيضاً
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.
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.
Many real-world complex systems are best modeled by multiplex networks. The multiplexity has proved to have broad impact on the systems structure and function. Most theoretical studies on multiplex networks to date, however, have largely ignored the
effect of link overlap across layers despite strong empirical evidences for its significance. In this article, we investigate the effect of link overlap in the viability of multiplex networks, both analytically and numerically. Distinctive role of overlapping links in viability and mutual connectivity is emphasized and exploited for setting up proper analytic framework. A rich phase diagram for viability is obtained and greatly diversified patterns of hysteretic behavior in viability are observed in the presence of link overlap. Mutual percolation with link overlap is revisited as a limit of multiplex viability problem, and controversy between existing results is clarified. The distinctive role of overlapping links is further demonstrated by the different responses of networks under random removals of overlapping and non-overlapping links, respectively, as well as under several removal strategies. Our results show that the link overlap strongly facilitates viability and mutual percolation; at the same time, the presence of link overlap poses challenge in analytical approach to the problem.
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.
Many real-world complex systems are best modeled by multiplex networks of interacting network layers. The multiplex network study is one of the newest and hottest themes in the statistical physics of complex networks. Pioneering studies have proven t
hat the multiplexity has broad impact on the systems structure and function. In this Colloquium paper, we present an organized review of the growing body of current literature on multiplex networks by categorizing existing studies broadly according to the type of layer coupling in the problem. Major recent advances in the field are surveyed and some outstanding open challenges and future perspectives will be proposed.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
