Evolution of random catalytic networks

PDF Version Also Available for Download.

Description

In this paper the authors investigate the evolution of populations of sequences on a random catalytic network. Sequences are mapped into structures, between which are catalytic interactions that determine their instantaneous fitness. The catalytic network is constructed as a random directed graph. They prove that at certain parameter values, the probability of some relevant subgraphs of this graph, for example cycles without outgoing edges, is maximized. Populations evolving under point mutations realize a comparatively small induced subgraph of the complete catalytic network. They present results which show that populations reliably discover and persist on directed cycles in the catalytic graph, ... continued below

Physical Description

10 p.

Creation Information

Fraser, S.M. & Reidys, C.M. June 1, 1997.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Authors

Sponsors

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

In this paper the authors investigate the evolution of populations of sequences on a random catalytic network. Sequences are mapped into structures, between which are catalytic interactions that determine their instantaneous fitness. The catalytic network is constructed as a random directed graph. They prove that at certain parameter values, the probability of some relevant subgraphs of this graph, for example cycles without outgoing edges, is maximized. Populations evolving under point mutations realize a comparatively small induced subgraph of the complete catalytic network. They present results which show that populations reliably discover and persist on directed cycles in the catalytic graph, though these may be lost because of stochastic effects, and study the effect of population size on this behavior.

Physical Description

10 p.

Notes

OSTI as DE97007473

Source

  • European conference on artificial life (ECAL) conference, Brighton (United Kingdom), Jul 1997

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Other: DE97007473
  • Report No.: LA-UR--97-1107
  • Report No.: CONF-970766--1
  • Grant Number: W-7405-ENG-36
  • Office of Scientific & Technical Information Report Number: 486081
  • Archival Resource Key: ark:/67531/metadc677447

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • June 1, 1997

Added to The UNT Digital Library

  • July 25, 2015, 2:21 a.m.

Description Last Updated

  • June 22, 2016, 7:07 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 2

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Fraser, S.M. & Reidys, C.M. Evolution of random catalytic networks, article, June 1, 1997; New Mexico. (digital.library.unt.edu/ark:/67531/metadc677447/: accessed September 21, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.