Suppr超能文献

通过对级联故障的局部适应来打开加权网络上的瓶颈。

Opening bottlenecks on weighted networks by local adaptation to cascade failures.

作者信息

Alstott Jeff, Pajevic Sinisa, Bullmore Ed, Plenz Dietmar

机构信息

Section on Critical Brain Dynamics, National Institute of Mental Health, Bethesda, MD, USA and Brain Mapping Unit, Behavioural and Clinical Neuroscience Institute, University of Cambridge, Cambridge, UK.

Mathematical and Statistical Computing Laboratory, Division of Computational Bioscience, Center for Information Technology, National Institutes of Health, Bethesda, MD, USA.

出版信息

J Complex Netw. 2015 Dec;3(4):552-565. doi: 10.1093/comnet/cnv002. Epub 2015 Mar 9.

Abstract

Structure and dynamics of complex systems are often described using weighted networks in which the position, weight and direction of links quantify how activity propagates between system elements, or nodes. Nodes with only few outgoing links of low weight have low out-strength and thus form bottlenecks that hinder propagation. It is currently not well understood how systems can overcome limits imposed by such bottlenecks. Here, we simulate activity cascades on weighted networks and show that, for any cascade length, activity initially propagates towards high out-strength nodes before terminating in low out-strength bottlenecks. Increasing the weights of links that are active early in the cascade further enhances already strong pathways, but worsens the bottlenecks thereby limiting accessibility to other pathways in the network. In contrast, strengthening only links that propagated the activity just prior to cascade termination, i.e. links that point into bottlenecks, eventually removes these bottlenecks and increases the accessibility of all paths on the network. This local adaptation rule simply relies on the relative timing to a global failure signal and allows systems to overcome engrained structure to adapt to new challenges.

摘要

复杂系统的结构和动态通常使用加权网络来描述,其中链接的位置、权重和方向量化了活动在系统元素(即节点)之间的传播方式。只有少数低权重输出链接的节点具有较低的输出强度,因此形成阻碍传播的瓶颈。目前尚不清楚系统如何克服此类瓶颈所带来的限制。在此,我们在加权网络上模拟活动级联,并表明,对于任何级联长度,活动最初会朝着高输出强度节点传播,然后在低输出强度瓶颈处终止。增加级联早期活跃链接的权重会进一步增强已经很强的路径,但会使瓶颈恶化,从而限制对网络中其他路径的可达性。相比之下,仅加强在级联终止前传播活动的链接,即指向瓶颈的链接,最终会消除这些瓶颈,并增加网络上所有路径的可达性。这种局部适应规则仅依赖于相对于全局故障信号的相对时间,并允许系统克服固有结构以适应新挑战。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/97b1/5589341/8972a1faeaf4/nihms899585f1.jpg

相似文献

2
Cascaded failures in weighted networks.加权网络中的级联故障。
Phys Rev E Stat Nonlin Soft Matter Phys. 2011 Oct;84(4 Pt 2):046114. doi: 10.1103/PhysRevE.84.046114. Epub 2011 Oct 25.
3
How damage diversification can reduce systemic risk.多元化损害如何降低系统性风险。
Phys Rev E. 2016 Apr;93:042313. doi: 10.1103/PhysRevE.93.042313. Epub 2016 Apr 22.
4
Tracing Road Network Bottleneck by Data Driven Approach.基于数据驱动方法的道路网络瓶颈追踪
PLoS One. 2016 May 26;11(5):e0156089. doi: 10.1371/journal.pone.0156089. eCollection 2016.
6
10
Percolation of interdependent networks with intersimilarity.具有相似性的相互依存网络的渗流
Phys Rev E Stat Nonlin Soft Matter Phys. 2013 Nov;88(5):052805. doi: 10.1103/PhysRevE.88.052805. Epub 2013 Nov 7.

本文引用的文献

1
The organization of strong links in complex networks.复杂网络中强连接的组织
Nat Phys. 2012;8:429-436. doi: 10.1038/nphys2257. Epub 2012 Mar 11.
3
Time-critical social mobilization.时间关键型社会动员。
Science. 2011 Oct 28;334(6055):509-12. doi: 10.1126/science.1205869.
6
Optimal weighting scheme for suppressing cascades and traffic congestion in complex networks.复杂网络中抑制级联故障和交通拥堵的最优加权方案。
Phys Rev E Stat Nonlin Soft Matter Phys. 2009 Feb;79(2 Pt 2):026112. doi: 10.1103/PhysRevE.79.026112. Epub 2009 Feb 27.
8
Communicability in complex networks.复杂网络中的传染性
Phys Rev E Stat Nonlin Soft Matter Phys. 2008 Mar;77(3 Pt 2):036111. doi: 10.1103/PhysRevE.77.036111. Epub 2008 Mar 11.
9
Phenomenological models of synaptic plasticity based on spike timing.基于脉冲时间的突触可塑性现象学模型。
Biol Cybern. 2008 Jun;98(6):459-78. doi: 10.1007/s00422-008-0233-1. Epub 2008 May 20.

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验