We consider the population dynamics of a set of species whose network of catalytic interactions is described by a directed graph. The relationship between the attractors of this dynamics and the underlying graph theoretic structures like cycles and autocatalytic sets is discussed. It is shown that when the population dynamics is suitably coupled to a slow dynamics of the graph itself, the network evolves towards increasing complexity driven by autocatalytic sets. Some quantitative measures of network complexity are described.
Emergence and growth of complex networks in adaptive systems
Published 1998 in Computer Physics Communications
ABSTRACT
PUBLICATION RECORD
- Publication year
1998
- Venue
Computer Physics Communications
- Publication date
1998-10-15
- Fields of study
Physics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-3 of 3 references · Page 1 of 1
CITED BY
Showing 1-56 of 56 citing papers · Page 1 of 1