Updating Schemes in Random Boolean Networks: Do They Really Matter?

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.

To be Published in Artificial Life IX. 6 pages, 7 figures. More info and better images at http://homepages.vub.ac.be/~cgershen/rbn

References in corpus (3)

• Classification of Random Boolean Networks
• Phase Transitions in Random Boolean Networks with Different Updating Schemes
• Robust gene regulation: Deterministic dynamics from asynchronous networks with delay

Cited by in corpus (6)

• Introduction to Random Boolean Networks
• Antifragility Predicts the Robustness and Evolvability of Biological Networks through Multi-class Classification with a Convolutional Neural Network
• Guiding the Self-organization of Random Boolean Networks
• Boolean automata isolated cycles and tangential double-cycles dynamics
• Dynamics of Unperturbed and Noisy Generalized Boolean Networks
• Fixed-points in Random Boolean Networks: The impact of parallelism in the scale-free topology case