Updating Schemes in Random Boolean Networks: Do They Really Matter?
<|reference_start|>Updating Schemes in Random Boolean Networks: Do They Really Matter?: 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.<|reference_end|>
@article{gershenson2004updating,
    title={Updating Schemes in Random Boolean Networks: Do They Really Matter?},
    author={Carlos Gershenson},
    journal={In Pollack, J., M. Bedau, P. Husbands, T. Ikegami, and R. A.
  Watson (eds.) Artificial Life IX, Proceedings of the Ninth International
  Conference on the Simulation and Synthesis of Living Systems. pp. 238-243.
  MIT Press. 2004},
    year={2004},
    archivePrefix={arXiv},
    eprint={nlin/0402006},
    primaryClass={nlin.AO cond-mat.other cs.CC nlin.CG q-bio.MN q-bio.OT q-bio.QM}
}