Cascading Failures in Bipartite Coupled Map Lattices

2012 ◽  
Vol 198-199 ◽  
pp. 1810-1814
Author(s):  
Dong Huang ◽  
Ying Pan ◽  
Jing Zhang Liang

In this paper, the cascading failures in a class of bipartite coupled map lattices are investigated. We found that for a network with given heterogeneity, international attack is much easier to trigger cascading failures than random attack. Furthermore, not only the mean node degree but also the largest eigenvalues of the network are found to relate to the size of cascading failures in the network. Therefore, this work might shed some light on the control of cascading failures in such structure of the network.

Author(s):  
Er-Shen Wang ◽  
Hong-Fan Ren ◽  
Chen Hong ◽  
Chang Liu ◽  
Ning He

2019 ◽  
Vol 525 ◽  
pp. 1038-1045 ◽  
Author(s):  
Er-Shen Wang ◽  
Chen Hong ◽  
Xu-Hong Zhang ◽  
Ning He

2013 ◽  
Vol 846-847 ◽  
pp. 853-857 ◽  
Author(s):  
Xing Zhao Peng ◽  
Bi Yue Li ◽  
Hong Yao

A cascading failure model for multi-layered networks is established using the Coupled Map Lattices (CML) method, the invulnerability of multi-layered network under random attacks and intentional attacks is investigated. The simulation results show that compared with isolated networks, multi-layered networks are more fragile and dont exhibit the invulnerability to suppress cascading failures under random attacks. Furthermore, we find that decreasing the inter-layer coupling strength or enhancing the inner-layer coupling strength can significantly improve the invulnerability of the multi-layered networks to resist cascading failures.


2019 ◽  
Vol 9 (23) ◽  
pp. 5021 ◽  
Author(s):  
Sun ◽  
Dong ◽  
Wang ◽  
Lv ◽  
War

Active distribution networks (ADNs) are a typical cyber–physical system (CPS), which consist of two kinds of interdependent sub-networks: power networks (PNs) and communication networks (CNs). The combination of typical characteristics of the ADN includes (1) a large number of distributed generators contained in the PN, (2) load redistribution in both the PN and CN, and (3) strong interdependence between the PN and CN, which makes ADNs vulnerable to cross-domain cascading failures (CCFs). In this paper, we focus on the robustness analysis of the ADN against the CCF. Rather than via the rate of the clusters with size greater than a predefined threshold, we evaluate the robustness of the ADN using the rate of the clusters containing generators after the CCF. Firstly, a synchronous probabilistic model is derived to calculate the proportions of remaining normal operational nodes after the CCF. With this model, the propagation of the CCF in the ADN can be described as recursive equations. Secondly, we analyze the relationship between the proportions of remaining normal operational nodes after the CCF and the distribution of distributed generators, unintentional random initial failure rate, the interdependence between the sub-networks, network topology, and tolerance parameters. Some results are revealed which include (1) the more distributed generators the PN contains, the higher ADN robustness is, (2) the robustness of the ADN is negatively correlated with the unintentional random initial failure rate, (3) the robustness of the ADN can be improved by increasing the average control fan in of each node in the PN and the average power fan in of each node in the CN, (4) the robustness of the ADN with Erdos–Renyi (ER) network topological structure is greater than that with Barabasi–Albert (BA) network topological structure under the same average node degree, and (5) the robustness of the ADN is greater, when the tolerance parameters increase. Lastly, some simulation experiments are conducted and experimental results also demonstrate that the conclusions above are effective to improve the robustness of the ADN against the CCF.


2020 ◽  
Author(s):  
Matthew Bailey ◽  
David Ormrod Morley ◽  
Mark Wilson

<p>A method to generate and simulate biological networks is discussed. An expanded Wooten-Winer-Weaire bond switching methods</p><p>is proposed which allows for</p><p>a distribution of node degrees in the network while conserving the mean average node degree.</p><p>The networks are characterised in terms of their polygon structure and assortativities (a measure</p><p>of local ordering). A wide range of experimental images are analysed and the underlying networks</p><p>quantified in an analogous manner. Limitations in obtaining the network structure are discussed.</p><p>A "network landscape" of the experimentally observed and simulated networks is constructed from the underlying metrics.</p><p>The enhanced bond switching algorithm is able to generate networks spanning the full range of experimental observations.</p>


2021 ◽  
Vol 1972 (1) ◽  
pp. 012032
Author(s):  
Tao Hu ◽  
Dong Wang ◽  
He Liu ◽  
Xin Yang ◽  
Longting Jiang ◽  
...  

2007 ◽  
Vol 21 (30) ◽  
pp. 2055-2062 ◽  
Author(s):  
DI CUI ◽  
ZIYOU GAO ◽  
XIAOMEI ZHAO

This paper presents a possible and reasonable explanation of cascading failure in small-world modular networks. We aim to introduce the CML's method to interpret the mechanism of cascading failure in small-world modular networks with different rewiring probability of inner-module and inter-module. The cascade propagation of such networks with the different initial external perturbation is simulated. Additionally, it is found that the perturbation threshold has close relationships with the modularity, the mean node degree and the rewiring probability. Based on the numerical simulation, we can see that the larger mean node degree can delay the cascading failure process. Furthermore, the small value of rewiring probability and larger modularity can efficiently delay the breakdown caused by the cascading failure. It is particularly important for controlling the cascading failure process in small-world modular networks.


Sign in / Sign up

Export Citation Format

Share Document