Research on cascading failure in multilayer network with different coupling preference

2017 ◽  
Vol 28 (04) ◽  
pp. 1750050 ◽  
Author(s):  
Yong Zhang ◽  
Lei Jin ◽  
Xiao Juan Wang
Keyword(s):  
Load Distribution ◽  
Random Network ◽  
Network Robustness ◽  
Cascading Failure ◽  
Failure Model ◽  
Scale Free Network ◽  
Multilayer Networks ◽  
Multilayer Network ◽  
Scale Free ◽  
Free Network

This paper is aimed at constructing robust multilayer networks against cascading failure. Considering link protection strategies in reality, we design a cascading failure model based on load distribution and extend it to multilayer. We use the cascading failure model to deduce the scale of the largest connected component after cascading failure, from which we can find that the performance of four kinds of load distribution strategies associates with the load ratio of the current edge to its adjacent edge. Coupling preference is a typical characteristic in multilayer networks which corresponds to the network robustness. The coupling preference of multilayer networks is divided into two forms: the coupling preference in layers and the coupling preference between layers. To analyze the relationship between the coupling preference and the multilayer network robustness, we design a construction algorithm to generate multilayer networks with different coupling preferences. Simulation results show that the load distribution based on the node betweenness performs the best. When the coupling coefficient in layers is zero, the scale-free network is the most robust. In the random network, the assortative coupling in layers is more robust than the disassortative coupling. For the coupling preference between layers, the assortative coupling between layers is more robust than the disassortative coupling both in the scale free network and the random network.

Traffic dynamics on multilayer networks with two logical layers

2021 ◽  
pp. 2150109
Author(s):  
Jinlong Ma ◽  
Zhichao Sun ◽  
Yongqiang Zhang ◽  
Xiangyang Xu ◽  
Ruimei Zhao ◽  
...  
Keyword(s):  
Network Model ◽  
Random Network ◽  
Physical Layer ◽  
Random Networks ◽  
Scale Free Network ◽  
Multilayer Networks ◽  
Traffic Dynamics ◽  
Scale Free ◽  
Traffic Capacity ◽  
Free Network

In order to study traffic dynamics on multilayer networks, it is of great significance to build a network model which can more exactly reflect the actual network layered structure characteristics. In this paper, a three-layer network model in which two logical layers are mapped on one physical layer is established, and the traffic capacities of three kinds of multilayer networks with different combinations of logical layers are compared. Simulation results show that when the physical layer is the same random network, the network whose logical layers are two random networks has the optimal traffic capacity, the network with one random network and one scale-free network in the logical layers has the better traffic capacity than the network whose logical layers are two scale-free networks.

Cascading failures mechanism based on betweenness-degree ratio distribution with different connecting preferences

2017 ◽  
Vol 28 (04) ◽  
pp. 1750052 ◽  
Author(s):  
Xiao Juan Wang ◽  
Shi Ze Guo ◽  
Lei Jin ◽  
Mo Chen
Keyword(s):  
Phase Transition ◽  
Failure Mechanism ◽  
Cascading Failure ◽  
Failure Model ◽  
Scale Free Network ◽  
Ratio Distribution ◽  
Vulnerable Area ◽  
Scale Free ◽  
Initial Load ◽  
Free Network

We study the structural robustness of the scale free network against the cascading failure induced by overload. In this paper, a failure mechanism based on betweenness-degree ratio distribution is proposed. In the cascading failure model we built the initial load of an edge which is proportional to the node betweenness of its ends. During the edge random deletion, we find a phase transition. Then based on the phase transition, we divide the process of the cascading failure into two parts: the robust area and the vulnerable area, and define the corresponding indicator to measure the performance of the networks in both areas. From derivation, we find that the vulnerability of the network is determined by the distribution of betweenness-degree ratio. After that we use the connection between the node ability coefficient and distribution of betweenness-degree ratio to explain the cascading failure mechanism. In simulations, we verify the correctness of our derivations. By changing connecting preferences, we find scale free networks with a slight assortativity, which performs better both in robust area and vulnerable area.

scholarly journals Analysis on Invulnerability of Wireless Sensor Network towards Cascading Failures Based on Coupled Map Lattice

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Xiuwen Fu ◽  
Yongsheng Yang ◽  
Haiqing Yao
Keyword(s):  
Random Network ◽  
Small World ◽  
Coupled Map Lattice ◽  
Wireless Sensor ◽  
Cascading Failures ◽  
Scale Free Network ◽  
Scale Free ◽  
Network Topologies ◽  
Free Network ◽  
Entire Network

Previous research of wireless sensor networks (WSNs) invulnerability mainly focuses on the static topology, while ignoring the cascading process of the network caused by the dynamic changes of load. Therefore, given the realistic features of WSNs, in this paper we research the invulnerability of WSNs with respect to cascading failures based on the coupled map lattice (CML). The invulnerability and the cascading process of four types of network topologies (i.e., random network, small-world network, homogenous scale-free network, and heterogeneous scale-free network) under various attack schemes (i.e., random attack, max-degree attack, and max-status attack) are investigated, respectively. The simulation results demonstrate that the rise of interference R and coupling coefficient ε will increase the risks of cascading failures. Cascading threshold values Rc and εc exist, where cascading failures will spread to the entire network when R>Rc or ε>εc. When facing a random attack or max-status attack, the network with higher heterogeneity tends to have a stronger invulnerability towards cascading failures. Conversely, when facing a max-degree attack, the network with higher uniformity tends to have a better performance. Besides that, we have also proved that the spreading speed of cascading failures is inversely proportional to the average path length of the network and the increase of average degree k can improve the network invulnerability.

scholarly journals EPIDEMIC DYNAMICS ON RANDOM AND SCALE-FREE NETWORKS

2012 ◽  
Vol 54 (1-2) ◽  
pp. 3-22 ◽  
Author(s):  
J. BARTLETT ◽  
M. J. PLANK
Keyword(s):  
Random Network ◽  
Infectious Agent ◽  
Mixed Population ◽  
Random Networks ◽  
Scale Free Network ◽  
Final Size ◽  
Scale Free ◽  
Epidemic Dynamics ◽  
Scale Free Networks ◽  
Free Network

AbstractRandom networks were first used to model epidemic dynamics in the 1950s, but in the last decade it has been realized that scale-free networks more accurately represent the network structure of many real-world situations. Here we give an analytical and a Monte Carlo method for approximating the basic reproduction number ${R}_{0} $ of an infectious agent on a network. We investigate how final epidemic size depends on ${R}_{0} $ and on network density in random networks and in scale-free networks with a Pareto exponent of 3. Our results show that: (i) an epidemic on a random network has the same average final size as an epidemic in a well-mixed population with the same value of ${R}_{0} $; (ii) an epidemic on a scale-free network has a larger average final size than in an equivalent well-mixed population if ${R}_{0} \lt 1$, and a smaller average final size than in a well-mixed population if ${R}_{0} \gt 1$; (iii) an epidemic on a scale-free network spreads more rapidly than an epidemic on a random network or in a well-mixed population.

EFFECTS OF CONFIDENCE SCALE AND NETWORK STRUCTURE ON MINORITY OPINION SPREADING

2010 ◽  
Vol 21 (08) ◽  
pp. 1001-1010 ◽  
Author(s):  
BO SHEN ◽  
YUN LIU
Keyword(s):  
Simple Model ◽  
Network Structure ◽  
Random Network ◽  
Random Networks ◽  
Scale Free Network ◽  
Opinion Formation ◽  
Scale Free ◽  
Scale Free Networks ◽  
Free Network ◽  
Confidence Scale

We study the dynamics of minority opinion spreading using a proposed simple model, in which the exchange of views between agents is determined by a quantity named confidence scale. To understand what will promote the success of minority, two types of networks, random network and scale-free network are considered in opinion formation. We demonstrate that the heterogeneity of networks is advantageous to the minority and exchanging views between more agents will reduce the opportunity of minority's success. Further, enlarging the degree that agents trust each other, i.e. confidence scale, can increase the probability that opinions of the minority could be accepted by the majority. We also show that the minority in scale-free networks are more sensitive to the change of confidence scale than that in random networks.

scholarly journals OPTIMIZATION OF SCALE-FREE NETWORK FOR RANDOM FAILURES

2006 ◽  
Vol 20 (14) ◽  
pp. 815-820 ◽  
Author(s):  
JIAN-GUO LIU ◽  
ZHONG-TUO WANG ◽  
YAN-ZHONG DANG
Keyword(s):  
Network Design ◽  
Degree Distribution ◽  
Design Guidelines ◽  
Network Robustness ◽  
Optimization Strategy ◽  
Scale Free Network ◽  
Scale Free ◽  
Optimal Value ◽  
Free Network ◽  
Random Failures

It has been found that the networks with scale-free degree distribution are very resilient for random failures. The purpose of this work is to determine the network design guidelines which maximize the network robustness for random failures when the average number of links per node of the network is constant. The optimal value of the degree distribution exponent and the minimum connectivity to different network sizes are given in this paper. Finally, the optimization strategy on how to improve the evolving network robustness is given.

scholarly journals Microscopic Numerical Simulations of Epidemic Models on Networks

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 932
Author(s):  
Yutaka Okabe ◽  
Akira Shudo
Keyword(s):  
Numerical Simulations ◽  
Random Network ◽  
Sir Model ◽  
Epidemic Models ◽  
Scale Free Network ◽  
Simple Derivation ◽  
Scale Free ◽  
Free Network ◽  
Epidemic Diseases

Mathematical models of the spread of epidemic diseases are studied, paying special attention to networks. We treat the Susceptible-Infected-Recovered (SIR) model and the Susceptible-Exposed-Infectious-Recovered (SEIR) model described by differential equations. We perform microscopic numerical simulations for corresponding epidemic models on networks. Comparing a random network and a scale-free network for the spread of the infection, we emphasize the role of hubs in a scale-free network. We also present a simple derivation of the exact solution of the SIR model.

Sign in / Sign up

Export Citation Format

Share Document