اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNonlocal failures in complex supply networks by single link additions
208
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
How do local topological changes affect the global operation and stability of complex supply networks? Studying supply networks on various levels of abstraction, we demonstrate that and how adding new links may not only promote but also degrade stable operation of a network. Intriguingly, the resulting overloads may emerge remotely from where such a link is added, thus resulting in nonlocal failure. We link this counter-intuitive phenomenon to Braess paradox originally discovered in traffic networks. We use elementary network topologies to explain its underlying mechanism for different types of supply networks and find that it generically occurs across these systems. As an important consequence, upgrading supply networks such as communication networks, biological supply networks or power grids requires particular care because even adding only single connections may destabilize normal network operation and induce disturbances remotely from the location of structural change and even global cascades of failures.
قيم البحث
اقرأ أيضاً
Link failures repeatedly induce large-scale outages in power grids and other supply networks. Yet, it is still not well understood, which links are particularly prone to inducing such outages. Here we analyze how the nature and location of each link
impact the networks capability to maintain stable supply. We propose two criteria to identify critical links on the basis of the topology and the load distribution of the network prior to link failure. They are determined via a links redundant capacity and a renormalized linear response theory we derive. These criteria outperform critical link prediction based on local measures such as loads. The results not only further our understanding of the physics of supply networks in general. As both criteria are available before any outage from the state of normal operation, they may also help real-time monitoring of grid operation, employing counter-measures and support network planning and design.
Community detection and link prediction are both of great significance in network analysis, which provide very valuable insights into topological structures of the network from different perspectives. In this paper, we propose a novel community detec
tion algorithm with inclusion of link prediction, motivated by the question whether link prediction can be devoted to improving the accuracy of community partition. For link prediction, we propose two novel indices to compute the similarity between each pair of nodes, one of which aims to add missing links, and the other tries to remove spurious edges. Extensive experiments are conducted on benchmark data sets, and the results of our proposed algorithm are compared with two classes of baseline. In conclusion, our proposed algorithm is competitive, revealing that link prediction does improve the precision of community detection.
Many real networks that are inferred or collected from data are incomplete due to missing edges. Missing edges can be inherent to the dataset (Facebook friend links will never be complete) or the result of sampling (one may only have access to a port
ion of the data). The consequence is that downstream analyses that consume the network will often yield less accurate results than if the edges were complete. Community detection algorithms, in particular, often suffer when critical intra-community edges are missing. We propose a novel consensus clustering algorithm to enhance community detection on incomplete networks. Our framework utilizes existing community detection algorithms that process networks imputed by our link prediction based algorithm. The framework then merges their multiple outputs into a final consensus output. On average our method boosts performance of existing algorithms by 7% on artificial data and 17% on ego networks collected from Facebook.
In todays global economy, supply chain (SC) entities have become increasingly interconnected with demand and supply relationships due to the need for strategic outsourcing. Such interdependence among firms not only increases efficiency but also creat
es more vulnerabilities in the system. Natural and human-made disasters such as floods and transport accidents may halt operations and lead to economic losses. Due to the interdependence among firms, the adverse effects of any disruption can be amplified and spread throughout the systems. This paper aims at studying the robustness of SC networks against cascading failures. Considering the upper and lower bound load constraints, i.e., inventory and cost, we examine the fraction of failed entities under load decrease and load fluctuation scenarios. The simulation results obtained from synthetic networks and a European supply chain network [1] both confirm that the recovery strategies of surplus inventory and backup suppliers often adopted in actual SCs can enhance the system robustness, compared with the system without the recovery process. In addition, the system is relatively robust against load fluctuations but is more fragile to demand shocks. For the underload-driven model without the recovery process, we found an occurrence of a discontinuous phase transition. Differently from other systems studied under overload cascading failures, this system is more robust for power-law distributions than uniform distributions of the lower bound parameter for the studied scenarios.
Identification of communities in complex networks has become an effective means to analysis of complex systems. It has broad applications in diverse areas such as social science, engineering, biology and medicine. Finding communities of nodes and fin
ding communities of links are two popular schemes for network structure analysis. These schemes, however, have inherent drawbacks and are often inadequate to properly capture complex organizational structures in real networks. We introduce a new scheme and effective approach for identifying complex network structures using a mixture of node and link communities, called hybrid node-link communities. A central piece of our approach is a probabilistic model that accommodates node, link and hybrid node-link communities. Our extensive experiments on various real-world networks, including a large protein-protein interaction network and a large semantic association network of commonly used words, illustrated that the scheme for hybrid communities is superior in revealing network characteristics. Moreover, the new approach outperformed the existing methods for finding node or link communities separately.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
