dorsal/arxiv
View SchemaGenetic networks with canalyzing Boolean rules are always stable
| Authors | Stuart Kauffman, Carsten Peterson, Björn Samuelsson, Carl Troein |
|---|---|
| Categories | |
| ArXiv ID | q-bio/0412005 |
| URL | https://arxiv.org/abs/q-bio/0412005 |
| DOI | 10.1073/pnas.0407783101 |
| Journal | Proc. Natl. Acad. Sci. USA 101 (2004), 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 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.
{
"annotation_id": "01182163-5c10-40ed-98e0-0306c33b132d",
"date_created": "2026-03-02T18:01:31.929000Z",
"date_modified": "2026-03-02T18:01:31.929000Z",
"file_hash": "c6cc35ffe2801e8363afd9f2c8ecbc53cc52e58d878f58ef24354df0a730c18e",
"private": false,
"record": {
"abstract": "We determine stability and attractor properties of random Boolean genetic\nnetwork models with canalyzing rules for a variety of architectures. For all\npower law, exponential, and flat in-degree distributions, we find that the\nnetworks are dynamically stable. Furthermore, for architectures with few inputs\nper node, the dynamics of the networks is close to critical. In addition, the\nfraction of genes that are active decreases with the number of inputs per node.\nThese results are based upon investigating ensembles of networks using\nanalytical methods. Also, for different in-degree distributions, the numbers of\nfixed points and cycles are calculated, with results intuitively consistent\nwith stability analysis; fewer inputs per node implies more cycles, and vice\nversa. There are hints that genetic networks acquire broader degree\ndistributions with evolution, and hence our results indicate that for single\ncells, the dynamics should become more stable with evolution. However, such an\neffect is very likely compensated for by multicellular dynamics, because one\nexpects less stability when interactions among cells are included. We verify\nthis by simulations of a simple model for interactions among cells.",
"arxiv_id": "q-bio/0412005",
"authors": [
"Stuart Kauffman",
"Carsten Peterson",
"Bj\u00f6rn Samuelsson",
"Carl Troein"
],
"categories": [
"q-bio.MN",
"cond-mat.soft"
],
"doi": "10.1073/pnas.0407783101",
"journal_ref": "Proc. Natl. Acad. Sci. USA 101 (2004), 17102-17107",
"title": "Genetic networks with canalyzing Boolean rules are always stable",
"url": "https://arxiv.org/abs/q-bio/0412005"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "3422957c-8ad3-4595-9b7b-9613dba62095",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}