...
首页> 外文期刊>Physica, A. Statistical mechanics and its applications >Modeling cascading failures in complex networks based on radiate circle
【24h】

Modeling cascading failures in complex networks based on radiate circle

机译:基于辐射圆的复杂网络级联故障建模

获取原文
获取原文并翻译 | 示例

摘要

This article introduces a new approach for defining the initial load of a node in a network and investigate how to allocate the initial load so as to maximize the network robustness against cascading failures and minimize the protection cost. Motivated by the radiate circle of a node in a network, we define the initial load of node i in a network to be Li=(ki) α0(∑i1∈Γiki1)α1(∑i2∈Γi1ki2) α2?(∑in∈Γin-1kin)αn with ki and Γi being the degree of node i and the set of its neighboring nodes, respectively, where α0,α1,α2,?, and αn are tunable parameters, governing the strength of the node initial load, and generally n=12D, of which D represents the diameter of a network. According to the definition of the initial load of a node and the local preferential redistribution mechanism of the load of a failed node, we construct a cascading model. We then present exact analytical solutions for the critical threshold βc as a metric of the network robustness, where there should evidently exist some crossover behavior of the system from large scale breakdown to no breakdown. Surprisingly, both analytically and numerically, we find that, when α0+α1+α 2+?+αn=1, all networks with no degree-degree correlation can reach the strongest robust level against cascading failures and the network robustness has a positive with the average degree of a network. Our findings highlight how to allocate the initial load and construct the network so as to obtain the strongest robustness.
机译:本文介绍了一种用于定义网络中节点的初始负载的新方法,并研究了如何分配初始负载,从而最大程度地提高了针对级联故障的网络健壮性并最小化了保护成本。根据网络中某个节点的辐射圆,我们将网络中节点i的初始负载定义为Li =(ki)α0(∑i1∈Γiki1)α1(∑i2∈Γi1ki2)α2?(∑in∈ Γin-1kin)αn,其中ki和Γi分别是节点i的度及其相邻节点的集合,其中α0,α1,α2,α和αn是可调参数,控制着节点初始载荷的强度,以及通常n = 12D,其中D代表网络的直径。根据节点初始负荷的定义和故障节点负荷的局部优先再分配机制,建立了级联模型。然后,我们提出了针对临界阈值βc的精确分析解决方案,作为网络鲁棒性的度量,显然应该存在从大规模故障到无故障的系统交叉行为。出乎意料的是,无论从分析还是从数值上,我们都发现,当α0+α1+α2+α+αn= 1时,所有没有度数相关性的网络都可以达到针对级联故障的最强鲁棒性,并且网络鲁棒性与网络的平均程度。我们的发现强调了如何分配初始负载并构建网络,以获得最强的鲁棒性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号