# Phase Transitions in Random Boolean Networks with Different Updating Schemes

@article{Gershenson2003PhaseTI, title={Phase Transitions in Random Boolean Networks with Different Updating Schemes}, author={Carlos Gershenson}, journal={ArXiv}, year={2003}, volume={nlin.AO/0311008} }

In this paper we study the phase transitions of different types of Random Boolean networks. These differ in their updating scheme: synchronous, semi-synchronous, or asynchronous, and deterministic or non-deterministic. It has been shown that the statistical properties of Random Boolean networks change considerable according to the updating scheme. We study with computer simulations sensitivity to initial conditions as a measure of order/chaos. We find that independently of their updating scheme…

## 25 Citations

The Information Dynamics of Phase Transitions in Random Boolean Networks

- Computer ScienceALIFE
- 2008

This work uses a recently published framework to characterize the distributed computation in terms of its underlying information dynamics: information storage, information transfer and information modification, and finds maximizations in information storage and coherent information transfer on either side of the critical point.

A Fisher Information Study of Phase Transitions in Random Boolean Networks

- Computer ScienceALIFE
- 2010

The order-chaos phase transition in random Boolean networks (RBNs) is studied to characterise the phase diagram in information-theoretic terms, focussing on the effect of the control parameters (activity level and connectivity).

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

- Physics, Computer ScienceArXiv
- 2004

It is concluded that synchonous RBNs are justifiable theoretical models of biological networks because all updating schemes yield very similar critical stability values, meaning that the "edge of chaos" does not depend much on the updating scheme.

Fisher Information at the Edge of Chaos in Random Boolean Networks

- Computer Science, MedicineArtificial Life
- 2011

The order-chaos phase transition in random Boolean networks (RBNs) is studied to characterize the phase diagram in information-theoretic terms, focusing on the effect of the control parameters (activity level and connectivity).

Asynchronous random Boolean network model based on elementary cellular automata rule 126.

- Mathematics, MedicinePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2005

It is shown, both theoretically and by example, that the ARBNs generate an ordered behavior regardless of the updating scheme used, whereas the GARBNs have behaviors that range from order to chaos depending on the type of random variable used to determine the number of nodes to be updated and the parameter combinations.

The Effects of State Dependent and State Independent Probabilistic Updating on Boolean Network Dynamics

- Mathematics
- 2005

We study semi-synchronous Boolean networks with robabilistic updating schemes and various topologies (tree, loop, and random). As well as state independent probabilistic updating we investigate a…

Introduction to Random Boolean Networks

- Computer Science, PhysicsArXiv
- 2004

The goal of this tutorial is to promote interest in the study of random Boolean networks (RBNs). These can be very interesting models, since one does not have to assume any functionality or…

Information Dynamics in Small-World Boolean Networks

- Computer Science, MedicineArtificial Life
- 2011

An ensemble investigation of the computational capabilities of small-world networks as compared to ordered and random topologies finds that the ordered phase of the dynamics and topologies with low randomness are dominated by information storage, while the chaotic phase is dominated byInformation storage and information transfer.

Algebraic approach to asynchronous Boolean networks

- Mathematics2011 Chinese Control and Decision Conference (CCDC)
- 2011

Using the structural matrix, we give a new frame work to study asynchronous random Boolean networks under different update schemes, which contain asynchronous random networks (ARBNs), deterministic…

Random Boolean Networks as a toy model for the brain

- 2017

The brain is a complex system whose functioning shapes how sensory information is transformed into behavioural response. It is made of a large number of interacting elements which collectively…

## References

SHOWING 1-10 OF 20 REFERENCES

Critical Values in Asynchronous Random Boolean Networks

- Computer ScienceECAL
- 2003

This work presents a similar and original approach for asynchronous RBNs and shows that they do not possess such a critical connectivity value as predicted by Derrida’s annealed approximation, and shows instead that they tend to amplify small and to reduce big perturbations.

Classification of Random Boolean Networks

- Mathematics, Computer ScienceArXiv
- 2002

This work provides the first classification of different types of Random Boolean Networks (RBNs), and finds that the point attractors are independent of the updating scheme, and that RBNs are more different depending on their determinism or non-determinism rather than depending on the degree of synchronicity or asynChronicity.

Boolean Dynamics with Random Couplings

- Physics, Mathematics
- 2003

This paper reviews a class of generic dissipative dynamical systems called N-K models. In these models, the dynamics of N elements, defined as Boolean variables, develop step by step, clocked by a…

Contextual Random Boolean Networks

- Computer Science, PhysicsECAL
- 2003

The situation where the authors lack knowledge on the context is introduced as a more realistic model for contextual dynamical systems and makes the network non-deterministic in a specific way, namely introducing a non-Kolmogorovian quantum-like structure for the modelling of the network.

Random networks of automata: a simple annealed approximation

- Physics
- 1986

Kauffman's model is a random complex automata where nodes are randomly assembled. Each node σi receives K inputs from K randomly chosen nodes and the values of σi at time t + 1 is a random Boolean…

Robust gene regulation: Deterministic dynamics from asynchronous networks with delay

- Biology, Physics
- 2003

It is found that a simple time delay in the nodes may induce a reproducible deterministic dynamics even in the case of asynchronous update in random order, pointing at a possible general principle of how computation in gene regulation networks can be kept in a quasi-deterministic ``clockwork mode'' in spite of the absence of a central clock.