A common property of many large networks, including the Internet, is that the connectivity of the various nodes follows a scale-free power-law distribution, P (k) = ck −α . We study the stability of such networks with respect to crashes, such as random removal of sites. Our approach, based on percolation theory, leads to a general condition for the critical fraction of nodes, pc, that need to be removed before the network disintegrates. We show analytically and numerically that for α ≤ 3 the transition never takes place, unless the network is finite. In the special case of the physical structure of the Internet (α ≈ 2.5), we find that it is impressively robust, with pc > 0. 99. 02.50.Cw, 05.40.a, 05.50.+q, 64.60.Ak
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.