ﻻ يوجد ملخص باللغة العربية
The failure of a single link can degrade the operation of a supply network up to the point of complete collapse. Yet, the interplay between network topology and locality of the response to such damage is poorly understood. Here, we study how topology affects the redistribution of flow after the failure of a single link in linear flow networks with a special focus on power grids. In particular, we analyze the decay of flow changes with distance after a link failure and map it to the field of an electrical dipole for lattice-like networks. The corresponding inverse-square law is shown to hold for all regular tilings. For sparse networks, a long-range response is found instead. In the case of more realistic topologies, we introduce a rerouting distance, which captures the decay of flow changes better than the traditional geodesic distance. Finally, we are able to derive rigorous bounds on the strength of the decay for arbitrary topologies that we verify through extensive numerical simulations. Our results show that it is possible to forecast flow rerouting after link failures to a large extent based on purely topological measures and that these effects generally decay with distance from the failing link. They might be used to predict links prone to failure in supply networks such as power grids and thus help to construct grids providing a more robust and reliable power supply.
The smooth operation of supply networks is crucial for the proper functioning of many systems, ranging from biological organisms such as the human blood transport system or plant leaves to man-made systems such as power grids or gas pipelines. Wherea
Cascading failure is a potentially devastating process that spreads on real-world complex networks and can impact the integrity of wide-ranging infrastructures, natural systems, and societal cohesiveness. One of the essential features that create com
We propose an efficient and accurate measure for ranking spreaders and identifying the influential ones in spreading processes in networks. While the edges determine the connections among the nodes, their specific role in spreading should be consider
Cascading failures constitute an important vulnerability of interconnected systems. Here we focus on the study of such failures on networks in which the connectivity of nodes is constrained by geographical distance. Specifically, we use random geomet
Non-Markovian spontaneous recovery processes with a time delay (memory) are ubiquitous in the real world. How does the non-Markovian characteristic affect failure propagation in complex networks? We consider failures due to internal causes at the nod