Updating Schemes in Random Boolean Networks: Do They Really Matter?
Adaptation and Self-Organizing Systems
2011-11-10 v3 Other Condensed Matter
Computational Complexity
Cellular Automata and Lattice Gases
Molecular Networks
Other Quantitative Biology
Quantitative Methods
Abstract
In this paper we try to end the debate concerning the suitability of different updating schemes in random Boolean networks (RBNs). We quantify for the first time loose attractors in asyncrhonous RBNs, which allows us to analyze the complexity reduction related to different updating schemes. We also report that all updating schemes yield very similar critical stability values, meaning that the "edge of chaos" does not depend much on the updating scheme. After discussion, we conclude that synchonous RBNs are justifiable theoretical models of biological networks.
Keywords
Cite
@article{arxiv.nlin/0402006,
title = {Updating Schemes in Random Boolean Networks: Do They Really Matter?},
author = {Carlos Gershenson},
journal= {arXiv preprint arXiv:nlin/0402006},
year = {2011}
}
Comments
To be Published in Artificial Life IX. 6 pages, 7 figures. More info and better images at http://homepages.vub.ac.be/~cgershen/rbn