Spontaneous recovery in dynamical networks

  title={Spontaneous recovery in dynamical networks},
  author={Antonio Majdandzic and Boris Podobnik and Sergey V. Buldyrev and Dror Y. Kenett and Shlomo Havlin and Harry Eugene Stanley},
  journal={Nature Physics},
Networks that fail can sometimes recover spontaneously—think of traffic jams suddenly easing or people waking from a coma. A model for such recoveries reveals spontaneous ‘phase flipping’ between high-activity and low-activity modes, in analogy with first-order phase transitions near a critical point. 
Persistent Threshold Dynamics with Recovery in Complex Networks
An analytical framework is devised which characterizes not only the critical behavior but also the temporal evolution of network activity in both phases of persistent cascade-recovery dynamics on quasi-robust networks, which are robust against small trigger but may collapse for larger one.
Failure-recovery model with competition between failures in complex networks: a dynamical approach
Real systems are usually composed by units or nodes whose activity can be interrupted and restored intermittently due to complex interactions not only with the environment, but also with the same
Dynamical Recovery of Complex Networks under a Localised Attack
A framework to study the resilience behaviours of the network under a localised attack (LA) and provides insight into understanding the recovery process and a protection strategy of various complex systems from the perspective of damaged memory.
Failure and recovery in dynamical networks
A unifying theory is developed which links the dynamics of the model to contact processes and may help to better understand controllability in spatially embedded and random networks where spontaneous recovery of components can mitigate spontaneous failure and damage spread in dynamical networks.
Cascading failure and recovery of spatially interdependent networks
Many real networks, such as infrastructure networks, are interdependent and their structure is influenced by spatial constraints. However, the existence of spatial constraints and dependency links
Vitality of Neural Networks under Reoccurring Catastrophic Failures
It is experimentally shown that excitatory neural networks are governed by a non-Poissonian reoccurrence of catastrophic failures, where their repetition time follows a multimodal distribution characterized by a few tenths of a second and tens of seconds timescales.
Critical transitions in heterogeneous networks: Loss of low-degree nodes as an early warning signal.
It is suggested that a significant reduction in less connected nodes can indicate impending global failure, and a minimal two-state dynamic on a complex network and the effect of local connectivities on the evolution of network nodes are proposed.
Reviving a failed network via microscopic interventions
Applied to a range of nonlinear network dynamics, a complex system's recoverable phase is identified, a state in which the system can be reignited by a microscopic intervention, i.e. controlling just a single node.
Recovery of Interdependent Networks
A recovery strategy for nodes is introduced and an analytic and numerical framework for studying the concurrent failure and recovery of a system of interdependent networks based on an efficient and practically reasonable strategy is developed.
Predicting Lifetime of Dynamical Networks Experiencing Persistent Random Attacks
This work analyzes a class of decaying dynamical networks experiencing persistent attacks in which the magnitude of the attack is quantified by the probability of aninternal failure, and there is some chance that an internal failure will be permanent.


Networks formed from interdependent networks
Aspects concerning the structure and behaviours of individual networks have been studied intensely in the past decade, but the exploration of interdependent systems in the context of complex networks
Modelling dynamical processes in complex socio-technical systems
The fundamental tools for modelling dynamical processes, including epidemic outbreaks and routing of information through computer networks are reviewed and a number of applications are discussed.
A simple model of global cascades on random networks
  • D. Watts
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
It is shown that heterogeneity plays an ambiguous role in determining a system's stability: increasingly heterogeneous thresholds make the system more vulnerable to global cascades; but anincreasingly heterogeneous degree distribution makes it less vulnerable.
Catastrophic cascade of failures in interdependent networks
This work develops a framework for understanding the robustness of interacting networks subject to cascading failures and presents exact analytical solutions for the critical fraction of nodes that, on removal, will lead to a failure cascade and to a complete fragmentation of two interdependent networks.
Collective dynamics of ‘small-world’ networks
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Resilience of the internet to random breakdowns
This work shows analytically and numerically that for alpha</=3 the transition never takes place, unless the network is finite, and finds that the physical structure of the Internet is impressively robust, with p(c)>0.99.
Emergence of scaling in random networks
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
The Structure and Function of Complex Networks
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Free zero-range processes on networks
A free zero-range process (FRZP) is a simple stochastic process describing the dynamics of a gas of particles hopping between neighboring nodes of a network. We discuss three different cases of