scholarly journals Vulnerability Analysis of Interdependent Scale-Free Networks with Complex Coupling

2017 ◽  
Vol 2017 ◽  
pp. 1-5
Author(s):  
Chunjie Cao ◽  
Zhiqiang Zhang ◽  
Jingzhang Sun ◽  
Xianpeng Wang ◽  
Mengxing Huang
Keyword(s):  
Network Design ◽  
Vulnerability Analysis ◽  
Network Nodes ◽  
Scale Free ◽  
Interdependent Networks ◽  
Coupling Relationship ◽  
Scale Free Networks ◽  
Random Node

Recent studies have shown that random nodes are vulnerable in interdependent networks with simple coupling. However, relationships in actual networks are interrelated and complex coupling. This paper analyzes the vulnerability of interdependent scale-free networks with complex coupling based on the BA model. The results indicate that these networks have the same vulnerability against the maximum node attack, the load of the maximum node attack, and the random node attack, which explain that the coupling relationship between network nodes is an important factor in network design.

scholarly journals NONUNIVERSALITY IN SEMI-DIRECTED BARABÁSI–ALBERT NETWORKS

2012 ◽  
Vol 23 (09) ◽  
pp. 1250062 ◽  
Author(s):  
M. A. SUMOUR ◽  
M. A. RADWAN
Keyword(s):  
Type A ◽  
Network Nodes ◽  
Scale Free ◽  
Scale Free Networks ◽  
Usual Scale

In usual scale-free networks of Barabási–Albert type, a newly added node selects randomly m neighbors from the already existing network nodes, proportionally to the number of links these had before. Then the number n(k) of nodes with k links each decays as 1/kγ where γ = 3 is universal, i.e. independent of m. Now we use a limited directedness in building the network, as a result of which the exponent γ decreases from 3 to 2 for increasing m.

scholarly journals OPTIMIZATION OF ROBUSTNESS OF SCALE-FREE NETWORK TO RANDOM AND TARGETED ATTACKS

2005 ◽  
Vol 19 (16) ◽  
pp. 785-792 ◽  
Author(s):  
JIAN-GUO LIU ◽  
ZHONG-TUO WANG ◽  
YAN-ZHONG DANG
Keyword(s):  
Network Design ◽  
Scale Free Network ◽  
Design Guideline ◽  
Scale Free ◽  
Targeted Attacks ◽  
Maximum Value ◽  
Scale Free Networks ◽  
Free Network ◽  
Random Failures ◽  
Connectivity Distribution

Scale-free networks, having connectivity distribution P(k)~k-α (where k is the site connectivity), are very resilient to random failures but are fragile to intentional attacks. The purpose of this paper is to find the network design guideline which can make the robustness of the network to both random failures and intentional attacks maximum while keeping the average connectivity <k> per node constant. We find that when <k> = 3 the robustness of the scale-free networks reach its maximum value if the minimal connectivity m = 1, but when <k> is larger than four, the networks will become more robust to random failures and targeted attacks as the minimal connectivity m gets larger.

EFFECT OF CLIENT DEMANDS ON DESTRUCTIVENESS OF TARGETED ATTACKS IN DIRECTED WEIGHTED SCALE-FREE NETWORKS

2011 ◽  
Vol 25 (19) ◽  
pp. 1603-1617 ◽  
Author(s):  
LI-LI MA ◽  
XIN JIANG ◽  
ZHAN-LI ZHANG ◽  
ZHI-MING ZHENG
Keyword(s):  
Real World ◽  
Weight Distribution ◽  
Network Robustness ◽  
Network Nodes ◽  
Scale Free ◽  
Node Importance ◽  
Targeted Attacks ◽  
Link Weight ◽  
Scale Free Networks ◽  
Unique Mechanism

Network resilience is vital for the survival of networks, and scale-free networks are fragile when confronted with targeted attacks. We survey network robustness to targeted attacks from the viewpoint of network clients by designing a unique mechanism based on the undeniable roles of network clients in real-world networks. Especially, the mechanism here is designed on the actual phenomenon that the vital nodes in a network may be totally different for clients with different demands. Concretely, node client-demand centrality is proposed to quantify the contributions of nodes to network clients and we show that it is a proper index to assign an order to network nodes according to node importance for network clients. Great discrepancy of node importance order for clients with different demands is found in scale-free networks with four different kinds of link weight distribution, which suggests that the destructiveness of fatal attacks on networks can be greatly reduced by adjusting the demands of network clients.

Cascading Failures in Two-Layered Interdependent Scale-Free Networks

2013 ◽  
Vol 419 ◽  
pp. 918-924
Author(s):  
Xing Zhao Peng ◽  
Hong Yao ◽  
Jun Du ◽  
Chao Ding ◽  
Zhi Hao Zhang
Keyword(s):  
Average Degree ◽  
Cascading Failures ◽  
Failure Model ◽  
Cascading Effects ◽  
Scale Free ◽  
Interdependent Networks ◽  
The Past ◽  
Interdependent Network ◽  
Scale Free Networks ◽  
Random Failures

Cascading failures in isolated networks have been widely studied in the past decade, cascading failures in interdependent networks are attracting more and more attention recently, but previous studies focus on the interdependent networks topological cascading effects, neglecting the loads which present in most real networks. Considering the effect of loads, the two-layered interdependent BA network model and the cascading failure model were reestablished in this paper, based on these, the robustness of interdependent networks under random failures and intentional attacks and the effects of average degree on the suppressing of cascading failures were researched. The simulation results show that compared to random failures, interdependent network is more vulnerable under intentional attacks; the network in coupled state is more vulnerable than in isolated state under random failures, while therere no obvious differences under intentional attacks; the network performs more robust to resist cascading failures if each layer network of the interdependent network hold larger average degree.

The trapping problem and the average shortest weighted path of the weighted pseudofractal scale-free networks

2019 ◽  
Vol 30 (01) ◽  
pp. 1950010 ◽  
Author(s):  
Meifeng Dai ◽  
Changxi Dai ◽  
Huiling Wu ◽  
Xianbin Wu ◽  
Wenjing Feng ◽  
...  
Keyword(s):  
Network Size ◽  
Exceptional Case ◽  
Weight Factor ◽  
Rigorous Solution ◽  
Network Nodes ◽  
Trapping Time ◽  
Scale Free ◽  
Wide Range ◽  
Scale Free Networks ◽  
Power Law Function

In this paper, we study the trapping time in the weighted pseudofractal scale-free networks (WPSFNs) and the average shortest weighted path in the modified weighted pseudofractal scale-free networks (MWPSFNs) with the weight factor [Formula: see text]. At first, for exceptional case with the trap fixed at a hub node for weight-dependent walk, we derive the exact analytic formulas of the trapping time through the structure of WPSFNs. The obtained rigorous solution shows that the trapping time approximately grows as a power-law function of the number of network nodes with the exponent represented by [Formula: see text]. Then, we deduce the scaling expression of the average shortest weighted path through the iterative process of the construction of MWPSFNs. The obtained rigorous solution shows that the scalings of average shortest weighted path with network size obey three laws along with the range of the weight factor. We provide a theoretical study of the trapping time for weight-dependent walk and the average shortest weighted path in a wide range of deterministic weighted networks.

scholarly journals Dynamics analysis of an online gambling spreading model on scale-free networks

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yu Kong ◽  
Tao Li ◽  
Yuanmei Wang ◽  
Xinming Cheng ◽  
He Wang ◽  
...  
Keyword(s):  
Network Topology ◽  
Negative Impact ◽  
Online Gambling ◽  
Basic Reproductive Number ◽  
Reproductive Number ◽  
Scale Free ◽  
Spreading Model ◽  
Spreading Dynamics ◽  
Scale Free Networks ◽  
Gambling Policy

AbstractNowadays, online gambling has a great negative impact on the society. In order to study the effect of people’s psychological factors, anti-gambling policy, and social network topology on online gambling dynamics, a new SHGD (susceptible–hesitator–gambler–disclaimer) online gambling spreading model is proposed on scale-free networks. The spreading dynamics of online gambling is studied. The basic reproductive number $R_{0}$ R 0 is got and analyzed. The basic reproductive number $R_{0}$ R 0 is related to anti-gambling policy and the network topology. Then, gambling-free equilibrium $E_{0}$ E 0 and gambling-prevailing equilibrium $E_{ +} $ E + are obtained. The global stability of $E_{0}$ E 0 is analyzed. The global attractivity of $E_{ +} $ E + and the persistence of online gambling phenomenon are studied. Finally, the theoretical results are verified by some simulations.

Sign in / Sign up

Export Citation Format

Share Document