Institut für Theoretische Physik, Universität Bremen, Hochschulring 18, D-28359 Bremen, Germany.
Phys Rev Lett. 2012 Sep 14;109(11):118703. doi: 10.1103/PhysRevLett.109.118703. Epub 2012 Sep 13.
We model the robustness against random failure or an intentional attack of networks with an arbitrary large-scale structure. We construct a block-based model which incorporates--in a general fashion--both connectivity and interdependence links, as well as arbitrary degree distributions and block correlations. By optimizing the percolation properties of this general class of networks, we identify a simple core-periphery structure as the topology most robust against random failure. In such networks, a distinct and small "core" of nodes with higher degree is responsible for most of the connectivity, functioning as a central "backbone" of the system. This centralized topology remains the optimal structure when other constraints are imposed, such as a given fraction of interdependence links and fixed degree distributions. This distinguishes simple centralized topologies as the most likely to emerge, when robustness against failure is the dominant evolutionary force.
我们对具有任意大规模结构的网络的随机故障或故意攻击的稳健性进行建模。我们构建了一个基于块的模型,该模型以通用的方式结合了连接性和相互依存性链路,以及任意的度分布和块相关性。通过优化这个通用网络类的渗流特性,我们确定了一个简单的核心-外围结构,作为最能抵抗随机故障的拓扑结构。在这样的网络中,具有更高度数的独特而小的“核心”节点负责大部分的连接性,充当系统的中央“骨干”。当施加其他约束时,例如给定的相互依存链路的分数和固定的度分布,这种集中式拓扑仍然是最优结构。这表明,当对故障的稳健性是主导的进化力量时,简单的集中式拓扑最有可能出现。