اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMacroscopic and Microscopic Characteristics of Networks with Time-variant Functionality for Evaluating Resilience to External Perturbations
51
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Knowledge of time-variant functionality of real-world physical, social, and engineered networks is critical to the understanding of the resilience of networks facing external perturbations. The majority of existing studies, however, focus only on the topological properties of networks for resilience assessment, which does not fully capture their dynamical resilience. In this study, we evaluate and quantify network resilience based both on the functionality states of links and on topology. We propose three independent measures---the failure scaling index (FSI), the weighted degree scaling index (WDSI), and the link functionality irregularity index (LFII)---that capture macroscopic, microscopic, and temporal performance characteristics of networks. Accordingly, an integrated general resilience (GR) metric is used to assess performance loss and recovery speed in networks with time-variant functionality. We test the proposed methods in the study of traffic networks under urban flooding impacts in the context of Harris County, Texas, during Hurricane Harvey using a high-resolution dataset, which contains temporal speed of 20,000 roads every 5 minutes for 5 months. Our results show that link weights and node weighted degrees with perturbed functionality in the traffic network during flooding follow a scale-free distribution. Hence, three proposed measures capture clear resilience curves of the network as well as identify the irregularity of links. Accordingly, network performance measures and the methodology for resilience quantification reveal insights into the extent of network performance loss and recovery speed, suggesting possible improvements in network resilience in the face of external perturbations such as urban flooding.
قيم البحث
اقرأ أيضاً
Detecting and characterizing community structure plays a crucial role in the study of networked systems. However, there is still a lack of understanding of how community structure affects the systems resilience and stability. Here, we develop a frame
work to study the resilience of networks with community structure based on percolation theory. We find both analytically and numerically that the interlinks (connections between the communities) affect the percolation phase transition in a manner similar to an external field in a ferromagnetic-paramagnetic spin system. We also study the universality class by defining the analogous critical exponents $delta$ and $gamma$, and find that their values for various models and in real-world co-authors networks follow fundamental scaling relations as in physical phase transitions. The methodology and results presented here not only facilitate the study of resilience of networks but also brings a fresh perspective to the understanding of phase transitions under external fields.
Epidemic propagation on complex networks has been widely investigated, mostly with invariant parameters. However, the process of epidemic propagation is not always constant. Epidemics can be affected by various perturbations, and may bounce back to i
ts original state, which is considered resilient. Here, we study the resilience of epidemics on networks, by introducing a different infection rate ${lambda_{2}}$ during SIS (susceptible-infected-susceptible) epidemic propagation to model perturbations (control state), whereas the infection rate is ${lambda_{1}}$ in the rest of time. Through simulations and theoretical analysis, we find that even for ${lambda_{2}<lambda_{c}}$, epidemics eventually could bounce back if control duration is below a threshold. This critical control time for epidemic resilience, i.e., ${cd_{max}}$ can be predicted by the diameter (${d}$) of the underlying network, with the quantitative relation ${cd_{max}sim d^{alpha}}$. Our findings can help to design a better mitigation strategy for epidemics.
Various social, financial, biological and technological systems can be modeled by interdependent networks. It has been assumed that in order to remain functional, nodes in one network must receive the support from nodes belonging to different network
s. So far these models have been limited to the case in which the failure propagates across networks only if the nodes lose all their supply nodes. In this paper we develop a more realistic model for two interdependent networks in which each node has its own supply threshold, i.e., they need the support of a minimum number of supply nodes to remain functional. In addition, we analyze different conditions of internal node failure due to disconnection from nodes within its own network. We show that several local internal failure conditions lead to similar nontrivial results. When there are no internal failures the model is equivalent to a bipartite system, which can be useful to model a financial market. We explore the rich behaviors of these models that include discontinuous and continuous phase transitions. Using the generating functions formalism, we analytically solve all the models in the limit of infinitely large networks and find an excellent agreement with the stochastic simulations.
We study rare events in networks with both internal and external noise, and develop a general formalism for analyzing rare events that combines pair-quenched techniques and large-deviation theory. The probability distribution, shape, and time scale o
f rare events are considered in detail for extinction in the Susceptible-Infected-Susceptible model as an illustration. We find that when both types of noise are present, there is a crossover region as the network size is increased, where the probability exponent for large deviations no longer increases linearly with the network size. We demonstrate that the form of the crossover depends on whether the endemic state is localized near the epidemic threshold or not.
Link failures in supply networks can have catastrophic consequences that can lead to a complete collapse of the network. Strategies to prevent failure spreading are thus heavily sought after. Here, we make use of a spanning tree formulation of link f
ailures in linear flow networks to analyse topological structures that prevent failures spreading. In particular, we exploit a result obtained for resistor networks based on the textit{Matrix tree theorem} to analyse failure spreading after link failures in power grids. Using a spanning tree formulation of link failures, we analyse three strategies based on the network topology that allow to reduce the impact of single link failures. All our strategies do not reduce the grids ability to transport flow or do in fact improve it - in contrast to traditional containment strategies based on lowering network connectivity. Our results also explain why certain connectivity features completely suppress any failure spreading as reported in recent publications.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
