pith. sign in

arxiv: nlin/0107037 · v1 · submitted 2001-07-17 · 🌊 nlin.AO · cond-mat

Crashes, Recoveries, and `Core-shifts' in a Model of Evolving Networks

classification 🌊 nlin.AO cond-mat
keywords crashesnetworkautocatalyticcrashevolvinggraphmodelrecoveries
0
0 comments X
read the original abstract

A model of an evolving network of interacting molecular species is shown to exhibit repeated rounds of crashes in which several species get rapidly depopulated, followed by recoveries. The network inevitably self-organizes into an autocatalytic structure, which consists of an irreducible `core' surrounded by a parasitic `periphery'. Crashes typically occur when the existing autocatalytic set becomes fragile and suffers a `core-shift', defined graph theoretically. The nature of the recovery after a crash, in particular the time of recovery, depends upon the organizational structure that survives the crash. The largest eigenvalue of the adjacency matrix of the graph is an important signal of network fragility or robustness.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.