Autocatalytic sets and the growth of complexity in an evolutionary model

Jain, Sanjay ; Krishna, Sandeep (1998) Autocatalytic sets and the growth of complexity in an evolutionary model Physical Review Letters, 81 (25). pp. 5684-5687. ISSN 0031-9007

[img]
Preview
PDF - Publisher Version
214kB

Official URL: http://prl.aps.org/abstract/PRL/v81/i25/p5684_1

Related URL: http://dx.doi.org/10.1103/PhysRevLett.81.5684

Abstract

A model of s interacting species is considered with two types of dynamical variables. The fast variables are the populations of the species and slow variables the links of a directed graph that defines the catalytic interactions among them. The graph evolves via mutations of the least fit species. Starting from a sparse random graph, we find that an autocatalytic set inevitably appears and triggers a cascade of exponentially increasing connectivity until it spans the whole graph. The connectivity subsequently saturates in a statistical steady state. The time scales for the appearance of an autocatalytic set in the graph and its growth have a power law dependence on s and the catalytic probability. At the end of the growth period the network is highly nonrandom, being localized on an exponentially small region of graph space for large s.

Item Type:Article
Source:Copyright of this article belongs to American Physical Society.
ID Code:12751
Deposited On:10 Nov 2010 08:40
Last Modified:16 May 2016 22:01

Repository Staff Only: item control page