Author:
BAGROW JAMES P.,LEHMANN SUNE,AHN YONG-YEOL
Abstract
AbstractComplex networks have recently attracted much interest due to their prevalence in nature and our daily lives (Vespignani, 2009; Newman, 2010). A critical property of a network is its resilience to random breakdown and failure (Albert et al., 2000; Cohen et al., 2000; Callaway et al., 2000; Cohen et al., 2001), typically studied as a percolation problem (Stauffer & Aharony, 1994; Achlioptas et al., 2009; Chen & D'Souza, 2011) or by modeling cascading failures (Motter, 2004; Buldyrev et al., 2010; Brummitt, et al. 2012). Many complex systems, from power grids and the Internet to the brain and society (Colizza et al., 2007; Vespignani, 2011; Balcan & Vespignani, 2011), can be modeled using modular networks comprised of small, densely connected groups of nodes (Girvan & Newman, 2002). These modules often overlap, with network elements belonging to multiple modules (Palla et al. 2005; Ahn et al. 2010). Yet existing work on robustness has not considered the role of overlapping, modular structure. Here we study the robustness of these systems to the failure of elements. We show analytically and empirically that it is possible for the modules themselves to become uncoupled or non-overlapping well before the network disintegrates. If overlapping modular organization plays a role in overall functionality, networks may be far more vulnerable than predicted by conventional percolation theory.
Publisher
Cambridge University Press (CUP)
Subject
Sociology and Political Science,Communication,Social Psychology
Reference38 articles.
1. Why social networks are different from other types of networks
2. Mørup M. , Madsen K. , Dogonowski A.-M. , Siebner H. , & Hansen L. K. (2010). Infinite relational modeling of functional connectivity in resting state fmri. Advances in Neural Information Processing Systems, Vol. 23, pp. 1750–1758.
3. Suppressing cascades of load in interdependent networks
4. Resilience of the Internet to Random Breakdowns
5. Link communities reveal multiscale complexity in networks
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献