基于超图的超网络相继故障分析

分析了快递超网络和电子元件超网络的相继故障扩散方式, 结合超图理论提出了2-section 图分析法和线图分析法, 并仿真分析了无标度超网络耦合映像格子的相继故障进程. 结果表明: 无标度超网络对外部攻击表现出了既鲁棒又脆弱的特性. 针对相继故障的不同扩散方式, 无标度超网络的相继故障行为表现出不同的特点. 超网络的相继故障行为和超网络的超度以及超边度分布有密切的联系, 也和超网络中超边的个数有关. 通过和同规模的Barabasi-Albert (BA)无标度网络对比, 在同一种攻击方式下同规模的无标度超网络都比BA 无标度网络表现出了更强的鲁棒性. 另外, 基于超边扩散的相继故障进程比基于节点扩散的相继故障进程更加缓慢.

Cascading failure analysis in hyper-network based on the hypergraph

In this paper, we analyze the diffusion patterns of cascading failure, which happen in the express hypernetwork and electronic hypernetwork respectively. The cascading failure of the express hypernetwork is diffused by the node, and the cascading failure of the electronic hypernetwork is diffused by the hyper-edge. According to hyper-graph theory, we propose two methods to characterize these cascading failures, which are 2-section graph analytical method and line-graph analytical method. We analyze the characteristics of the cascading failures based on node by using the 2-section graph analytical method and based on hyper-edge by using line-graph analytical method, respectively. We construct a k uniform scale-free hypernetwork and analyze the cascading failure process of this hypernetwork based on the couple map lattice according to our methods. The simulation results show that the scale-free hypernetworks are both robust and vulnerable for attack. It is found that the cascading failure based on the node of k uniform scale-free hypernetwork is associated with the hyper-degree distribution of nodes, and the scale-free hypernetwork is robust for random attack and vulnerable for deliberate attack. The more nodes a hyper-edge has, the better robustness the hypernetwork has.The cascading failure based on the hyper-edge is different from the cascading failure based on the node. The cascading failure based on the hyper-edge is associated with the hyper-edge degree distribution. The hyper-edge degree distribution of the scale-free hypernetwork is not entirely the power-low distribution. When the cascading failure is diffused by the hyper-edge, the hypernetwork is vulnerable for random attack and robustness for deliberate attack if there are 3 or 5 nodes in a hyper-edge. Moreover, the hypernetwork becomes robust for the random attack if there are 7 nodes in a hyper-edge. Furthermore, the k uniform scale-free hypernetwork is more robust than the same size Barabasi-Albert scale-free network for the same attack. The cascading failure process based on the hyper-edge is slower than based on the node. We find that the edge number is another influential factor of robustness. The network is more robust if it has more edges for fixed node number. The line-graph has more edges than the 2-section graph in the same size scale-free hypernetwork, so the cascading failure of node is slower than that of hyper-edge.