Advanced

Genetic networks with canalyzing Boolean rules are always stable

Kauffman, S; Peterson, Carsten LU ; Samuelsson, Björn LU and Troein, Carl LU (2004) In Proceedings of the National Academy of Sciences 101(49). p.17102-17107
Abstract
We determine stability and attractor properties of random Boolean genetic network models with canalyzing rules for a variety of architectures. For all power law, exponential, and flat in-degree distributions, we find that the networks are dynamically stable. Furthermore, for architectures with few inputs per node, the dynamics of the networks is close to critical. In addition, the fraction of genes that are active decreases with the number of inputs per node. These results are based upon investigating ensembles of networks using analytical methods. Also, for different in-degree distributions, the numbers of fixed points and cycles are calculated, with results intuitively consistent with stability analysis; fewer inputs per node implies... (More)
We determine stability and attractor properties of random Boolean genetic network models with canalyzing rules for a variety of architectures. For all power law, exponential, and flat in-degree distributions, we find that the networks are dynamically stable. Furthermore, for architectures with few inputs per node, the dynamics of the networks is close to critical. In addition, the fraction of genes that are active decreases with the number of inputs per node. These results are based upon investigating ensembles of networks using analytical methods. Also, for different in-degree distributions, the numbers of fixed points and cycles are calculated, with results intuitively consistent with stability analysis; fewer inputs per node implies more cycles, and vice versa. There are hints that genetic networks acquire broader degree distributions with evolution, and hence our results indicate that for single cells, the dynamics should become more stable with evolution. However, such an effect is very likely compensated for by multicellular dynamics, because one expects less stability when interactions among cells are included. We verify this by simulations of a simple model for interactions among cells. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
Proceedings of the National Academy of Sciences
volume
101
issue
49
pages
17102 - 17107
publisher
National Acad Sciences
external identifiers
  • wos:000225740100024
  • scopus:10344259662
ISSN
1091-6490
DOI
10.1073/pnas.0407783101
language
English
LU publication?
yes
id
5be6e12a-4986-449d-a050-4acb49c0d772 (old id 258242)
alternative location
http://www.pnas.org/cgi/content/abstract/0407783101v1
date added to LUP
2007-10-23 18:04:20
date last changed
2017-10-29 03:38:59
@article{5be6e12a-4986-449d-a050-4acb49c0d772,
  abstract     = {We determine stability and attractor properties of random Boolean genetic network models with canalyzing rules for a variety of architectures. For all power law, exponential, and flat in-degree distributions, we find that the networks are dynamically stable. Furthermore, for architectures with few inputs per node, the dynamics of the networks is close to critical. In addition, the fraction of genes that are active decreases with the number of inputs per node. These results are based upon investigating ensembles of networks using analytical methods. Also, for different in-degree distributions, the numbers of fixed points and cycles are calculated, with results intuitively consistent with stability analysis; fewer inputs per node implies more cycles, and vice versa. There are hints that genetic networks acquire broader degree distributions with evolution, and hence our results indicate that for single cells, the dynamics should become more stable with evolution. However, such an effect is very likely compensated for by multicellular dynamics, because one expects less stability when interactions among cells are included. We verify this by simulations of a simple model for interactions among cells.},
  author       = {Kauffman, S and Peterson, Carsten and Samuelsson, Björn and Troein, Carl},
  issn         = {1091-6490},
  language     = {eng},
  number       = {49},
  pages        = {17102--17107},
  publisher    = {National Acad Sciences},
  series       = {Proceedings of the National Academy of Sciences},
  title        = {Genetic networks with canalyzing Boolean rules are always stable},
  url          = {http://dx.doi.org/10.1073/pnas.0407783101},
  volume       = {101},
  year         = {2004},
}