Error and attack tolerance of complex networks

@article{Albert2000ErrorAA,
  title={Error and attack tolerance of complex networks},
  author={R{\'e}ka Albert and Hawoong Jeong and A. L. Barabasi},
  journal={Nature},
  year={2000},
  volume={406},
  pages={378-382}
}
Many complex systems display a surprising degree of tolerance against errors. For example, relatively simple organisms grow, persist and reproduce despite drastic pharmaceutical or environmental interventions, an error tolerance attributed to the robustness of the underlying metabolic network. Complex communication networks display a surprising degree of robustness: although key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability… Expand
Error and attack tolerance of small-worldness in complex networks
TLDR
The profile of changes in the small-worldness as a result of errors/attacks was independent of network size, while it was influenced by average degree and rewiring probability of Watts–Strogatz model. Expand
Effect of Dormant Spare Capacity on the Attack Tolerance of Complex Networks
TLDR
This work proposes a strategy in which there is a pre- existing, dormant spare capacity already built into the network for an identified vulnerable node, such that the traffic of the disrupted node can be diverted to another pre-existing node/set of nodes in the network. Expand
Assessing the significance of knockout cascades in metabolic networks
TLDR
A cascading failure algorithm is employed to simulate the removal of single and pairs of reactions from the metabolic networks of two organisms, and the analysis suggests that evolutionary pressure promotes larger cascades of non-viable reactions, and thus favors the ability of efficient metabolic regulation at the expense of robustness. Expand
Exploring the topological sources of robustness against invasion in biological and technological networks
TLDR
This work explores the sources of robustness of the US high-voltage power grid network, the Internet2 academic network, and the C. elegans connectome and finds that, contrary to what happens with networks of small order, fixation probability and robustness are poorly correlated with most of standard statistics, but they depend strongly on the degree distribution. Expand
Exploring the topological sources of robustness against invasion in biological and technological networks
TLDR
This work explores the sources of robustness of the US high-voltage power grid network, the Internet2 academic network, and the C. elegans connectome and finds that, contrary to what happens with networks of small order, fixation probability and robustness are poorly correlated with most of standard statistics, but they depend strongly on the degree distribution. Expand
Growing Self-Organized Design of Efficient and Robust Complex Networks
  • Y. Hayashi
  • Computer Science, Physics
  • 2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems
  • 2014
TLDR
It is shown that, by biologically inspired copying, an onion-like network emerges in the incremental growth with functions of proxy access and reinforced connectivity on a space, which will be useful for a resilient and scalable infrastructure of network systems even in emergent situations or poor environments. Expand
Robustness and Evolution of Scale-Free Networks in Biology
The prevalence of scale-free networks in multiple biological systems (such as metabolic, proteomic, and genomic networks) raises the question of what brings about the spontaneous formation ofExpand
Compensatory ability to null mutation in metabolic networks
TLDR
Analyzing more than 800 organism's metabolic networks suggests that the reactions with larger impact degrees are likely essential and the universal reactions should also be essential, and shows that scale‐free feature and reaction reversibility contribute to the robustness in metabolic networks. Expand
Abnormal phenomenon in robustness of complex networks with heterogeneous node functions
TLDR
A data-transmission network which contains two types of nodes: routers and hosts is considered, and how the capacity redundancy of different nodes affects network robustness is studied to advance understanding of the robustness for networks with heterogeneous node functions. Expand
Are Scale-Free Networks Functionally Robust ?
This paper reexamines the claim that biological networks are robust due to their scale-free (SF) architecture, by presenting a basic and simple way to assess the role that this architecture plays inExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 55 REFERENCES
The large-scale organization of metabolic networks
TLDR
This analysis of metabolic networks of 43 organisms representing all three domains of life shows that, despite significant variation in their individual constituents and pathways, these metabolic networks have the same topological scaling properties and show striking similarities to the inherent organization of complex non-biological systems. Expand
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. Expand
Small-World Networks: Evidence for a Crossover Picture
Watts and Strogatz [Nature (London) 393, 440 (1998)] have recently introduced a model for disordered networks and reported that, even for very small values of the disorder $p$ in the links, theExpand
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems. Expand
Size and form in efficient transportation networks
TLDR
The theory accounts in a general way for the quarter-power allometric scaling of living organisms and predicts scaling relations applicable to all efficient transportation networks, which is verified from observational data on the river drainage basins. Expand
Mean-field theory for scale-free random networks
TLDR
A mean-field method is developed to predict the growth dynamics of the individual vertices of the scale-free model, and this is used to calculate analytically the connectivity distribution and the scaling exponents. Expand
End-to-end routing behavior in the Internet
The large-scale behavior of routing in the Internet has gone virtually without any formal study, the exception being Chinoy's analysis of the dynamics of Internet routing information [Ch93]. WeExpand
Simple rules yield complex food webs
TLDR
This model extends the existing ‘cascade model’ and improves its fit ten-fold by constraining species to consume a contiguous sequence of prey in a one-dimensional trophic niche. Expand
A quantitative comparison of graph-based models for Internet topology
TLDR
A set of metrics that characterize the graphs produced by a method are considered, and the similarities and differences among several generation methods with respect to these metrics are quantified. Expand
On power-law relationships of the Internet topology
TLDR
These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period, and can be used to generate and select realistic topologies for simulation purposes. Expand
...
1
2
3
4
5
...