Stability of complex networks under the evolution of attack and repair
L. P. Chi, C. B. Yang, X. Cai
Abstract
With a simple attack and repair evolution model, we investigate and compare the stability of the Erdos-Renyi random graphs (RG) and Barabasi-Albert scale-free (SF) networks. We introduce a new quantity, invulnerability I(s), to describe the stability of the system. We find that both RG and SF networks can evolve to a stationary state. The stationary value Ic has a power-law dependence on the average degree <k>rg for RG networks; and an exponential relationship with the repair probability psf for SF networks. We also discuss the topological changes of RG and SF networks between the initial and stationary states. We observe that the networks in the stationary state have smaller average degree <k> but larger clustering coefficient C and stronger assortativity r.
Create a lesson
Related papers
Dynamically Reentrant Skyrmion Phase in Oscillating Magnetic Fields
Z. Demir Vatansever, E. Vatansever, A. Vasilopoulos et al.
Mutual linearity in semi-Markov networks
Julian B. Voits, Ulrich S. Schwarz
Steady states in asymmetric exclusion processes with reactions: Fluctuations and non-mean field behaviour
Rohn Chatterjee, Atri Goswami, Sudip Mukherjee
Marginal Operator Deformations and Pseudocriticality in Baxter--Wu Models
Hyun-Yong Lee, Naoki Kawashima, Nikolaos G. Fytas et al.
Kardar--Parisi--Zhang density hydrodynamics in a coherent XXZ--ASEP Lindbladian
Yansheng Liu, Daoguang Li, Kaixiang Lu et al.
Brownian gyrator model with stochastic resetting
Satya N. Majumdar, Gregory Schehr, Pascal Viot et al.