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

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

2004-02-05

arxiv.org/abs/nlin/0402006v3

In Pollack, J., M. Bedau, P. Husbands, T. Ikegami, and R. A. Watson (eds.) Artificial Life IX, Proceedings of the Ninth Intern

Nonlinear Sciences

Adaptation and Self-Organizing Systems

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

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Updating Schemes in Random Boolean Networks: Do They Really Matter? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Updating Schemes in Random Boolean Networks: Do They Really Matter?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Updating Schemes in Random Boolean Networks: Do They Really Matter? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318873