Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

The robustness of multiplex networks under layer node-based attack.

ABSTRACT: From transportation networks to complex infrastructures, and to social and economic networks, a large variety of systems can be described in terms of multiplex networks formed by a set of nodes interacting through different network layers. Network robustness, as one of the most successful application areas of complex networks, has attracted great interest in a myriad of research realms. In this regard, how multiplex networks respond to potential attack is still an open issue. Here we study the robustness of multiplex networks under layer node-based random or targeted attack, which means that nodes just suffer attacks in a given layer yet no additional influence to their connections beyond this layer. A theoretical analysis framework is proposed to calculate the critical threshold and the size of giant component of multiplex networks when nodes are removed randomly or intentionally. Via numerous simulations, it is unveiled that the theoretical method can accurately predict the threshold and the size of giant component, irrespective of attack strategies. Moreover, we also compare the robustness of multiplex networks under multiplex node-based attack and layer node-based attack, and find that layer node-based attack makes multiplex networks more vulnerable, regardless of average degree and underlying topology.

SUBMITTER: Zhao DW

PROVIDER: S-EPMC4830959 | biostudies-other | 2016 Apr

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

Robustness of controllability for networks based on edge-attack.

Project description:We study the controllability of networks in the process of cascading failures under two different attacking strategies, random and intentional attack, respectively. For the highest-load edge attack, it is found that the controllability of Erd?s-Rényi network, that with moderate average degree, is less robust, whereas the Scale-free network with moderate power-law exponent shows strong robustness of controllability under the same attack strategy. The vulnerability of controllability under random and intentional attacks behave differently with the increasing of removal fraction, especially, we find that the robustness of control has important role in cascades for large removal fraction. The simulation results show that for Scale-free networks with various power-law exponents, the network has larger scale of cascades do not mean that there will be more increments of driver nodes. Meanwhile, the number of driver nodes in cascading failures is also related to the edges amount in strongly connected components.

| S-EPMC3935847 | biostudies-literature

Robustness of network attack strategies against node sampling and link errors.

Project description:We investigate the effectiveness of network attack strategies when the attacker has only imperfect information about the network. While most existing network attack strategies assume complete knowledge about the network, in reality it is difficult to obtain the complete structure of a large-scale complex network. This paper considers two scenarios in which the available network information is imperfect. In one scenario, the network contains link errors (i.e., missing and false links) due to measurement errors, and in the other scenario the target network is so large that only part of the network structure is available from network sampling. Through extensive simulations, we show that particularly in a network with highly skewed degree distribution, network attack strategies are robust against link errors. Even if the network contains 30% false links and missing links, the strategies are just as effective as when the complete network is available. We also show that the attack strategies are far less effective when the network is obtained from random sampling, whereas the detrimental effects of network sampling on network attack strategies are small when using biased sampling strategies such as breadth-first search, depth-first search, and sample edge counts. Moreover, the effectiveness of network attack strategies is examined in the context of network immunization, and the implications of the results are discussed.

| S-EPMC6726205 | biostudies-literature

Uncertainty in vulnerability of networks under attack.

Project description:This study builds conceptual explanations and empirical examinations of the vulnerability response of networks under attack. Two quantities of "vulnerability" and "uncertainty in vulnerability" are defined by scrutinizing the performance loss trajectory of networks experiencing attacks. Both vulnerability and uncertainty in vulnerability quantities are a function of the network topology and size. This is tested on 16 distinct topologies appearing in infrastructure, social, and biological networks with 8 to 26 nodes under two percolation scenarios exemplifying benign and malicious attacks. The findings imply (i) crossing path, tree, and diverging tail are the most vulnerable topologies, (ii) complete and matching pairs are the least vulnerable topologies, (iii) complete grid and complete topologies show the most uncertainty for vulnerability, and (iv) hub-and-spoke and double u exhibit the least uncertainty in vulnerability. The findings also imply that both vulnerability and uncertainty in vulnerability increase with an increase in the size of the network. It is argued that in networks with no undirected cycle and one undirected cycle, the uncertainty in vulnerability is maximal earlier in the percolation process. With an increase in the number of cycles, the uncertainty in vulnerability is accumulated at the end of the percolation process. This emphasizes the role of tailoring preparedness, response, and recovery phases for networks with different topologies when they might experience disruption.

| S-EPMC9947912 | biostudies-literature

NECo: A node embedding algorithm for multiplex heterogeneous networks.

Project description:Complex diseases such as hypertension, cancer, and diabetes cause nearly 70% of the deaths in the U.S. and involve multiple genes and their interactions with environmental factors. Therefore, identification of genetic factors to understand and decrease the morbidity and mortality from complex diseases is an important and challenging task. With the generation of an unprecedented amount of multi-omics datasets, network-based methods have become popular to represent the multilayered complex molecular interactions. Particularly node embeddings, the low-dimensional representations of nodes in a network are utilized for gene function prediction. Integrated network analysis of multi-omics data alleviates the issues related to missing data and lack of context-specific datasets. Most of the node embedding methods, however, are unable to integrate multiple types of datasets from genes and phenotypes. To address this limitation, we developed a node embedding algorithm called Node Embeddings of Complex networks (NECo) that can utilize multilayered heterogeneous networks of genes and phenotypes. We evaluated the performance of NECo using genotypic and phenotypic datasets from rat (Rattus norvegicus) disease models to classify hypertension disease-related genes. Our method significantly outperformed the state-of-the-art node embedding methods, with AUC of 94.97% compared 85.98% in the second-best performer, and predicted genes not previously implicated in hypertension.

| S-EPMC8466723 | biostudies-literature

Enhancing robustness of coupled networks under targeted recoveries.

Project description:Coupled networks are extremely fragile because a node failure of a network would trigger a cascade of failures on the entire system. Existing studies mainly focused on the cascading failures and the robustness of coupled networks when the networks suffer from attacks. In reality, it is necessary to recover the damaged networks, and there are cascading failures in recovery processes. In this study, firstly, we analyze the cascading failures of coupled networks during recoveries. Then, a recovery robustness index is presented for evaluating the resilience of coupled networks to cascading failures in the recovery processes. Finally, we propose a technique aiming at protecting several influential nodes for enhancing robustness of coupled networks under the recoveries, and adopt six strategies based on the potential knowledge of network centrality to find the influential nodes. Experiments on three coupling networks demonstrate that with a small number of influential nodes protected, the robustness of coupled networks under the recoveries can be greatly enhanced.

| S-EPMC4327128 | biostudies-other

Double-layer optimization model for integrated energy system under multiple robustness.

Project description:Output instability is one of the important constraints limiting the large-scale application of renewable energy. The development of comprehensive energy systems can effectively improve energy utilization efficiency, but there is still a problem of randomness in renewable energy output. The paper conducts research on the uncertainty of distributed energy output and load, constructs a comprehensive energy system optimization model that takes into account the robustness of bilevel programming, and solves the model using the firefly algorithm. The calculation results show that optimizing uncertainty can significantly reduce the actual operating costs of the system, with a maximum reduction of 14.43%. When the distributed wind power interval is within [0190], a dynamic balance between cost and consumption rate can be achieved.

| S-EPMC10522003 | biostudies-literature

Node Survival in Networks under Correlated Attacks.

Project description:We study the interplay between correlations, dynamics, and networks for repeated attacks on a socio-economic network. As a model system we consider an insurance scheme against disasters that randomly hit nodes, where a node in need receives support from its network neighbors. The model is motivated by gift giving among the Maasai called Osotua. Survival of nodes under different disaster scenarios (uncorrelated, spatially, temporally and spatio-temporally correlated) and for different network architectures are studied with agent-based numerical simulations. We find that the survival rate of a node depends dramatically on the type of correlation of the disasters: Spatially and spatio-temporally correlated disasters increase the survival rate; purely temporally correlated disasters decrease it. The type of correlation also leads to strong inequality among the surviving nodes. We introduce the concept of disaster masking to explain some of the results of our simulations. We also analyze the subsets of the networks that were activated to provide support after fifty years of random disasters. They show qualitative differences for the different disaster scenarios measured by path length, degree, clustering coefficient, and number of cycles.

| S-EPMC4416727 | biostudies-literature

Layer-switching cost and optimality in information spreading on multiplex networks.

Project description:We study a model of information spreading on multiplex networks, in which agents interact through multiple interaction channels (layers), say online vs. offline communication layers, subject to layer-switching cost for transmissions across different interaction layers. The model is characterized by the layer-wise path-dependent transmissibility over a contact, that is dynamically determined dependently on both incoming and outgoing transmission layers. We formulate an analytical framework to deal with such path-dependent transmissibility and demonstrate the nontrivial interplay between the multiplexity and spreading dynamics, including optimality. It is shown that the epidemic threshold and prevalence respond to the layer-switching cost non-monotonically and that the optimal conditions can change in abrupt non-analytic ways, depending also on the densities of network layers and the type of seed infections. Our results elucidate the essential role of multiplexity that its explicit consideration should be crucial for realistic modeling and prediction of spreading phenomena on multiplex social networks in an era of ever-diversifying social interaction layers.

| S-EPMC4757841 | biostudies-other

Evolution under fluctuating environments explains observed robustness in metabolic networks.

Project description:A high level of robustness against gene deletion is observed in many organisms. However, it is still not clear which biochemical features underline this robustness and how these are acquired during evolution. One hypothesis, specific to metabolic networks, is that robustness emerges as a byproduct of selection for biomass production in different environments. To test this hypothesis we performed evolutionary simulations of metabolic networks under stable and fluctuating environments. We find that networks evolved under the latter scenario can better tolerate single gene deletion in specific environments. Such robustness is underlined by an increased number of independent fluxes and multifunctional enzymes in the evolved networks. Observed robustness in networks evolved under fluctuating environments was "apparent," in the sense that it decreased significantly as we tested effects of gene deletions under all environments experienced during evolution. Furthermore, when we continued evolution of these networks under a stable environment, we found that any robustness they had acquired was completely lost. These findings provide evidence that evolution under fluctuating environments can account for the observed robustness in metabolic networks. Further, they suggest that organisms living under stable environments should display lower robustness in their metabolic networks, and that robustness should decrease upon switching to more stable environments.

| S-EPMC2928748 | biostudies-literature

Link prediction in real-world multiplex networks via layer reconstruction method.

Project description:Networks are invaluable tools to study real biological, social and technological complex systems in which connected elements form a purposeful phenomenon. A higher resolution image of these systems shows that the connection types do not confine to one but to a variety of types. Multiplex networks encode this complexity with a set of nodes which are connected in different layers via different types of links. A large body of research on link prediction problem is devoted to finding missing links in single-layer (simplex) networks. In recent years, the problem of link prediction in multiplex networks has gained the attention of researchers from different scientific communities. Although most of these studies suggest that prediction performance can be enhanced by using the information contained in different layers of the network, the exact source of this enhancement remains obscure. Here, it is shown that similarity w.r.t. structural features (eigenvectors) is a major source of enhancements for link prediction task in multiplex networks using the proposed layer reconstruction method and experiments on real-world multiplex networks from different disciplines. Moreover, we characterize how low values of similarity w.r.t. structural features result in cases where improving prediction performance is substantially hard.

| S-EPMC7428284 | 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