Network growth models and genetic regulatory networks

D. V. Foster, S. A. Kauffman, and J. E. S. Socolar
Phys. Rev. E 73, 031912 – Published 14 March 2006

Abstract

We study a class of growth algorithms for directed graphs that are candidate models for the evolution of genetic regulatory networks. The algorithms involve partial duplication of nodes and their links, together with the innovation of new links, allowing for the possibility that input and output links from a newly created node may have different probabilities of survival. We find some counterintuitive trends as the parameters are varied, including the broadening of the in-degree distribution when the probability for retaining input links is decreased. We also find that both the scaling of transcription factors with genome size and the measured degree distributions for genes in yeast can be reproduced by the growth algorithm if and only if a special seed is used to initiate the process.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 4 October 2005

DOI:https://doi.org/10.1103/PhysRevE.73.031912

©2006 American Physical Society

Authors & Affiliations

D. V. Foster1, S. A. Kauffman2, and J. E. S. Socolar1

  • 1Physics Department and Center for Nonlinear and Complex Systems, Duke University, Durham, North Carolina 27514, USA
  • 2Institute for Biocomplexity and Informatics, University of Calgary, Calgary, Alberta T2N 1N4, Canada

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 73, Iss. 3 — March 2006

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×