Error and attack tolerance of complex networks

By Réka Albert, Hawoong Jeong, Albert-László

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Olaf Sporns
2. D. Bassett
3. Mark Newman
4. Jure Leskovec
5. Santo Fortunato
6. Jinhui Wang
7. Yong He
8. E. Bullmore

Citations in the corpus

• Evolution of resilience in protein interactomes across the tree of life (2018, background): “To determine how natural selection influences the structure of interactomes, we study the resilience of interactomes to network failures (23, 25, 26).”
• GAT: A Graph-Theoretical Analysis Toolbox for Analyzing Between-Group Differences in Large-Scale Structural and Functional Brain Networks (2012, background): “Pattern of distribution of nodal connectivity in a network (degree distribution) reveals specific characteristics of the network and its resilience to random failure and targeted attacks [3,13,62].”
• Functional and evolutionary inference in gene networks: does topology matter? (2006, background): “Thus, by this distance-based definition of network function, scale-free and random networks share an important property: they are robust to random failure, but very sensitive to targeted attacks on hubs (Albert et al. 2000a, b).”
• Using Graph Models to Analyze the Vulnerability of Electric Power Networks (2006, unknown): “5 we compare the two attack strategies, and in accordance with the observations of the behavior of other networks,(13) attacks based on recalculated distributions are the most harmful.”
• Why Do Hubs Tend to Be Essential in Protein Networks? (2006, unknown): “, network diameter) more than removing non-hubs [3].”
• Analysis of a large-scale weighted network of one-to-one human communication (2007, background): “We now turn to an examination of the implications of link removal on the global properties of networks, which has many precedents in the complex network literature [16, 37, 39, 40, 41, 42, 43, 44, 45].”
• Subnetwork hierarchies of biochemical pathways (2002, methodology): “…node as external is interpreted as deleting the node from the network of internal nodes, this method is equivalent to the attack vulnerability study of Albert et al. (2000), where scale-free networks’ (such as biochemical networks’) response to the removal of nodes in order of degree was discussed.”
• Control Centrality and Hierarchical Structure in Complex Networks (2012, background): “according to some centrality measure, like degree or control centrality, and remove the nodes with highest centralities [44,45].”
• Evolving protein interaction networks through gene duplication. (2003, background): “…(SF) networks appear to be present in many natural and artificial systems (Bornholdt and Schuster, 2002), ranging from technological networks (Albert et al., 2000; Amaral et al., 2000; Ferrer i Cancho et al., 2001a; Pastor-Satorras et al., 2001), neural networks (Watts and Strogatz, 1998;…”
• Reliability engineering: Old problems and new challenges (2009, background): “…the components is a critical feature of the system: the stability and robustness of these systems depend on the redundant wiring of the functional web interconnecting the system‟s components; yet, error tolerance and attack robustness are not shared by all redundant networks (Albert et al., 2000).”
• The small world of human language (2001, background): “Although scale-free networks are very tolerant to random removal of vertices, if deletion is directed to the most connected vertices the network gets broken into pieces (Albert et al., 2000).”