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

TL;DR

This paper investigates the impact of different updating schemes in random Boolean networks, showing that they have minimal effect on critical stability and justifying the use of synchronous models in biological contexts.

Contribution

It provides the first quantification of loose attractors in asynchronous RBNs and demonstrates that updating schemes have limited influence on network stability.

Findings

All updating schemes produce similar critical stability values.

Loose attractors are quantified in asynchronous RBNs.

Synchronous RBNs are justified as models of biological networks.

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.