Error and attack tolerance of complex networks
Reka Albert, Hawoong Jeong, Albert-Laszlo Barabasi
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.
Create a lesson
Related papers
Optical Ceiling on Polaron Mobility in Disordered Molecular Semiconductors: Lessons from Eumelanin
Alvan Hunt
Glauber dynamics of the Sherrington--Kirkpatrick spin-glass model: a dynamical cavity method
Grzegorz Szamel
Generative diffusion in long-range correlated landscapes: Speciation cascade and the foam structure of the score
Jerome Garnier-Brun, Giulio Biroli, Marc Mézard et al.
A Clifford-index approach connecting boundary Dirac fermions to sigma-model topological terms in the periodic table of topological insulators and superconductors
Y. X. Zhao
Exact solution of the dynamic pseudogap model: Fock-space formalism for Gaussian fluctuations
Michael V. Sadovskii
Covariance-dependent participation scaling of Comtet disorder on open hyperbolic lattices
Wei Li, Yong Cheng