Browse
Submit Data
Databases
API
Help

Dataset Information

49 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Network isolators inhibit failure spreading in complex networks.

ABSTRACT: In our daily lives, we rely on the proper functioning of supply networks, from power grids to water transmission systems. A single failure in these critical infrastructures can lead to a complete collapse through a cascading failure mechanism. Counteracting strategies are thus heavily sought after. In this article, we introduce a general framework to analyse the spreading of failures in complex networks and demostrate that not only decreasing but also increasing the connectivity of the network can be an effective method to contain damages. We rigorously prove the existence of certain subgraphs, called network isolators, that can completely inhibit any failure spreading, and we show how to create such isolators in synthetic and real-world networks. The addition of selected links can thus prevent large scale outages as demonstrated for power transmission grids.

SUBMITTER: Kaiser F

PROVIDER: S-EPMC8149673 | biostudies-literature | 2021 May

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Network isolators inhibit failure spreading in complex networks.

Kaiser Franz F Latora Vito V Witthaut Dirk D

Nature communications 20210525 1

In our daily lives, we rely on the proper functioning of supply networks, from power grids to water transmission systems. A single failure in these critical infrastructures can lead to a complete collapse through a cascading failure mechanism. Counteracting strategies are thus heavily sought after. In this article, we introduce a general framework to analyse the spreading of failures in complex networks and demostrate that not only decreasing but also increasing the connectivity of the network c ...[more]

PMID: 34035263

Similar Datasets

Spreading to localized targets in complex networks.

Project description:As an important type of dynamics on complex networks, spreading is widely used to model many real processes such as the epidemic contagion and information propagation. One of the most significant research questions in spreading is to rank the spreading ability of nodes in the network. To this end, substantial effort has been made and a variety of effective methods have been proposed. These methods usually define the spreading ability of a node as the number of finally infected nodes given that the spreading is initialized from the node. However, in many real cases such as advertising and news propagation, the spreading only aims to cover a specific group of nodes. Therefore, it is necessary to study the spreading ability of nodes towards localized targets in complex networks. In this paper, we propose a reversed local path algorithm for this problem. Simulation results show that our method outperforms the existing methods in identifying the influential nodes with respect to these localized targets. Moreover, the influential spreaders identified by our method can effectively avoid infecting the non-target nodes in the spreading process.

| S-EPMC5155210 | biostudies-literature

General methodology for inferring failure-spreading dynamics in networks.

Project description:A generic modeling framework to infer the failure-spreading process based on failure times of individual nodes is proposed and tested in four simulation studies: one for cascading failures in interdependent power and transportation networks, one for influenza epidemics, one benchmark test case for congestion cascade in a transportation network, and one benchmark test case for cascading power outages. Four general failure-spreading mechanisms-external, temporal, spatial, and functional-are quantified to capture what drives the spreading of failures. With the failure time of each node given, the proposed methodology demonstrates remarkable capability of inferring the underlying general failure-spreading mechanisms and accurately reconstructing the failure-spreading process in all four simulation studies. The analysis of the two benchmark test cases also reveals the robustness of the proposed methodology: It is shown that a failure-spreading process embedded by specific failure-spreading mechanisms such as flow redistribution can be captured with low uncertainty by our model. The proposed methodology thereby presents a promising channel for providing a generally applicable framework for modeling, understanding, and controlling failure spreading in a variety of systems.

| S-EPMC6126715 | biostudies-literature

Epidemic spreading on complex networks with community structures.

Project description:Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network, while the other model only preserves the set of communities and the vertex degrees. These models show that community structure is an important determinant of the behavior of percolation processes on networks, such as information diffusion or virus spreading: the community structure can both enforce as well as inhibit diffusion processes. Our models further show that it is the mesoscopic set of communities that matters. The exact internal structures of communities barely influence the behavior of percolation processes across networks. This insensitivity is likely due to the relative denseness of the communities.

| S-EPMC4954979 | biostudies-literature

Asymmetrically interacting spreading dynamics on complex layered networks.

Project description:The spread of disease through a physical-contact network and the spread of information about the disease on a communication network are two intimately related dynamical processes. We investigate the asymmetrical interplay between the two types of spreading dynamics, each occurring on its own layer, by focusing on the two fundamental quantities underlying any spreading process: epidemic threshold and the final infection ratio. We find that an epidemic outbreak on the contact layer can induce an outbreak on the communication layer, and information spreading can effectively raise the epidemic threshold. When structural correlation exists between the two layers, the information threshold remains unchanged but the epidemic threshold can be enhanced, making the contact layer more resilient to epidemic outbreak. We develop a physical theory to understand the intricate interplay between the two types of spreading dynamics.

| S-EPMC4037715 | biostudies-literature

Predicting the evolution of spreading on complex networks.

Project description:Due to the wide applications, spreading processes on complex networks have been intensively studied. However, one of the most fundamental problems has not yet been well addressed: predicting the evolution of spreading based on a given snapshot of the propagation on networks. With this problem solved, one can accelerate or slow down the spreading in advance if the predicted propagation result is narrower or wider than expected. In this paper, we propose an iterative algorithm to estimate the infection probability of the spreading process and then apply it to a mean-field approach to predict the spreading coverage. The validation of the method is performed in both artificial and real networks. The results show that our method is accurate in both infection probability estimation and spreading coverage prediction.

| S-EPMC4135329 | biostudies-other

Detailed-level modelling of influence spreading on complex networks.

Project description:The progress in high-performance computing makes it increasingly possible to build detailed models to investigate spreading processes on complex networks. However, current studies have been lacking detailed computational methods to describe spreading processes in large complex networks. To fill this gap we present a new modelling approach for analysing influence spreading via individual nodes and links on various network structures. The proposed influence-spreading model uses a probability matrix to capture the spreading probability from one node to another in the network. This approach enables analysing network characteristics in a number of applications and spreading processes using metrics that are consistent with the quantities used to model the network structures. In addition, this study combines sub-models and offers a comprehensive look at different applications and metrics previously discussed in cases of social networks, community detection, and epidemic spreading. Here, we also note that the centrality measures based on the probability matrix are used to identify the most significant nodes in the network. Furthermore, the model can be expanded to include additional properties, such as introducing individual breakthrough probabilities for the nodes and specific temporal distributions for the links.

| S-EPMC11564639 | biostudies-literature

The effects of evolutionary adaptations on spreading processes in complex networks.

Project description:A common theme among previously proposed models for network epidemics is the assumption that the propagating object (e.g., a pathogen [in the context of infectious disease propagation] or a piece of information [in the context of information propagation]) is transferred across network nodes without going through any modification or evolutionary adaptations. However, in real-life spreading processes, pathogens often evolve in response to changing environments and medical interventions, and information is often modified by individuals before being forwarded. In this article, we investigate the effects of evolutionary adaptations on spreading processes in complex networks with the aim of 1) revealing the role of evolutionary adaptations on the threshold, probability, and final size of epidemics and 2) exploring the interplay between the structural properties of the network and the evolutionary adaptations of the spreading process.

| S-EPMC7084153 | biostudies-literature

Modelling indirect interactions during failure spreading in a project activity network.

Project description:Spreading broadly refers to the notion of an entity propagating throughout a networked system via its interacting components. Evidence of its ubiquity and severity can be seen in a range of phenomena, from disease epidemics to financial systemic risk. In order to understand the dynamics of these critical phenomena, computational models map the probability of propagation as a function of direct exposure, typically in the form of pairwise interactions between components. By doing so, the important role of indirect interactions remains unexplored. In response, we develop a simple model that accounts for the effect of both direct and subsequent exposure, which we deploy in the novel context of failure propagation within a real-world engineering project. We show that subsequent exposure has a significant effect in key aspects, including the: (a) final spreading event size, (b) propagation rate, and (c) spreading event structure. In addition, we demonstrate the existence of 'hidden influentials' in large-scale spreading events, and evaluate the role of direct and subsequent exposure in their emergence. Given the evidence of the importance of subsequent exposure, our findings offer new insight on particular aspects that need to be included when modelling network dynamics in general, and spreading processes specifically.

| S-EPMC5847592 | biostudies-literature

Localized recovery of complex networks against failure.

Project description:Resilience of complex networks to failure has been an important issue in network research for decades, and recent studies have begun to focus on the inverse recovery of network functionality through strategically healing missing nodes or edges. However, the effect of network recovery is far from fully understood, and a general theory is still missing. Here we propose and study a general model of localized recovery, where a group of neighboring nodes are restored in an invasive way from a seed node. We develop a theoretical framework to compare the effect of random recovery (RR) and localized recovery (LR) in complex networks including Erdős-Rényi networks, random regular networks, and scale-free networks. We find detailed phase diagrams for the subnetwork of occupied nodes and the "complement network" of failed nodes under RR and LR. By identifying the two competitive forces behind LR, we present an analytical and numerical approach to guide us in choosing the appropriate recovery strategy and provide estimation on its effect by using the degree distribution of the original network as the only input. Our work therefore provides insight for quantitatively understanding recovery process and its implications in infrastructure protection in various complex systems.

| S-EPMC4960604 | biostudies-literature

Impacts of complex behavioral responses on asymmetric interacting spreading dynamics in multiplex networks.

Project description:Information diffusion and disease spreading in communication-contact layered network are typically asymmetrically coupled with each other, in which disease spreading can be significantly affected by the way an individual being aware of disease responds to the disease. Many recent studies have demonstrated that human behavioral adoption is a complex and non-Markovian process, where the probability of behavior adoption is dependent on the cumulative times of information received and the social reinforcement effect of the cumulative information. In this paper, the impacts of such a non-Markovian vaccination adoption behavior on the epidemic dynamics and the control effects are explored. It is found that this complex adoption behavior in the communication layer can significantly enhance the epidemic threshold and reduce the final infection rate. By defining the social cost as the total cost of vaccination and treatment, it can be seen that there exists an optimal social reinforcement effect and optimal information transmission rate allowing the minimal social cost. Moreover, a mean-field theory is developed to verify the correctness of simulation results.

| S-EPMC4860576 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data