%0 Journal Article %1 Albert2000Error %A Albert, Reka %A Jeong, Hawoong %A Barabasi, Albert-Laszlo %D 2000 %J Nature %K attack classic networks robustness %N 6794 %P 378--382 %R 10.1038/35019019 %T Error and attack tolerance of complex networks %U http://dx.doi.org/10.1038/35019019 %V 406 %X Many complex systems, such as communication networks, display a surprising degree of robustness: while key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network. The stability of these complex systems is often attributed to the redundant wiring of the functional web defined by the systems' components. In this paper we demonstrate that error tolerance is not shared by all redundant systems, but it is displayed only by a class of inhomogeneously wired networks, called scale-free networks. We find that scale-free networks, describing a number of systems, such as the World Wide Web, Internet, social networks or a cell, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected by even unrealistically high failure rates. However, error tolerance comes at a high price: these networks are extremely vulnerable to attacks, i.e. to the selection and removal of a few nodes that play the most important role in assuring the network's connectivity.

@article{Albert2000Error, abstract = {Many complex systems, such as communication networks, display a surprising degree of robustness: while key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network. The stability of these complex systems is often attributed to the redundant wiring of the functional web defined by the systems' components. In this paper we demonstrate that error tolerance is not shared by all redundant systems, but it is displayed only by a class of inhomogeneously wired networks, called scale-free networks. We find that scale-free networks, describing a number of systems, such as the World Wide Web, Internet, social networks or a cell, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected by even unrealistically high failure rates. However, error tolerance comes at a high price: these networks are extremely vulnerable to attacks, i.e. to the selection and removal of a few nodes that play the most important role in assuring the network's connectivity.}, added-at = {2018-12-02T16:09:07.000+0100}, archiveprefix = {arXiv}, author = {Albert, Reka and Jeong, Hawoong and Barabasi, Albert-Laszlo}, biburl = {https://www.bibsonomy.org/bibtex/2ed3520bd8aec6aaa0f8316bf28c92a00/karthikraman}, citeulike-article-id = {204822}, citeulike-linkout-0 = {http://arxiv.org/abs/cond-mat/0008064}, citeulike-linkout-1 = {http://arxiv.org/pdf/cond-mat/0008064}, citeulike-linkout-2 = {http://dx.doi.org/10.1038/35019019}, citeulike-linkout-3 = {http://dx.doi.org/10.1038/406378a0}, citeulike-linkout-4 = {http://view.ncbi.nlm.nih.gov/pubmed/10935628}, citeulike-linkout-5 = {http://www.hubmed.org/display.cgi?uids=10935628}, day = 3, doi = {10.1038/35019019}, eprint = {cond-mat/0008064}, interhash = {14d2fa7d508cc9254c71f9d4542c50c6}, intrahash = {ed3520bd8aec6aaa0f8316bf28c92a00}, issn = {0028-0836}, journal = {Nature}, keywords = {attack classic networks robustness}, month = aug, number = 6794, pages = {378--382}, pmid = {10935628}, posted-at = {2015-01-13 08:06:54}, priority = {2}, timestamp = {2018-12-02T16:09:07.000+0100}, title = {Error and attack tolerance of complex networks}, url = {http://dx.doi.org/10.1038/35019019}, volume = 406, year = 2000 }