dorsal/arxiv
View SchemaCounting attractors in synchronously updated random Boolean networks
| Authors | Björn Samuelsson, Carl Troein |
|---|---|
| Categories | |
| ArXiv ID | q-bio/0412035 |
| URL | https://arxiv.org/abs/q-bio/0412035 |
Abstract
Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. We here derive an expression for the number of attractors in the special case of one input per node. Approximating some other non-chaotic networks to be of this class, we apply the analytic results to them. For this approximation, we observe a strikingly good agreement on the numbers of attractors of various lengths. Furthermore, we find that for long cycle lengths, there are some properties that seem strange in comparison to real dynamical systems. However, those properties can be interesting from the viewpoint of constraint satisfaction problems.
{
"annotation_id": "b9139aa3-eb79-4edc-b61e-0a06dfd1afa5",
"date_created": "2026-03-02T18:01:32.338000Z",
"date_modified": "2026-03-02T18:01:32.338000Z",
"file_hash": "7622da8542ad2c1c35c101fbc67c23f9933ee8e7c9402e82ff36d82298e184bf",
"private": false,
"record": {
"abstract": "Despite their apparent simplicity, random Boolean networks display a rich\nvariety of dynamical behaviors. Much work has been focused on the properties\nand abundance of attractors. We here derive an expression for the number of\nattractors in the special case of one input per node. Approximating some other\nnon-chaotic networks to be of this class, we apply the analytic results to\nthem. For this approximation, we observe a strikingly good agreement on the\nnumbers of attractors of various lengths. Furthermore, we find that for long\ncycle lengths, there are some properties that seem strange in comparison to\nreal dynamical systems. However, those properties can be interesting from the\nviewpoint of constraint satisfaction problems.",
"arxiv_id": "q-bio/0412035",
"authors": [
"Bj\u00f6rn Samuelsson",
"Carl Troein"
],
"categories": [
"q-bio.MN",
"cond-mat.soft"
],
"title": "Counting attractors in synchronously updated random Boolean networks",
"url": "https://arxiv.org/abs/q-bio/0412035"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "0829260f-d9e2-4c6c-a2c0-ae90bdf92d94",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}