Corpus ID: 318

Phase Transitions in Random Boolean Networks with Different Updating Schemes

  title={Phase Transitions in Random Boolean Networks with Different Updating Schemes},
  author={Carlos Gershenson},
  • C. Gershenson
  • Published 5 November 2003
  • Physics, Computer Science, Biology, Mathematics
  • ArXiv
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… Expand
The Information Dynamics of Phase Transitions in Random Boolean Networks
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. Expand
A Fisher Information Study of Phase Transitions in Random Boolean Networks
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). Expand
Updating Schemes in Random Boolean Networks: Do They Really Matter?
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. Expand
Fisher Information at the Edge of Chaos in Random Boolean Networks
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). Expand
Asynchronous random Boolean network model based on elementary cellular automata rule 126.
  • M. T. Matache, J. Heidel
  • Mathematics, Medicine
  • Physical 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. Expand
The Effects of State Dependent and State Independent Probabilistic Updating on Boolean Network Dynamics
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 aExpand
Introduction to Random Boolean Networks
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 orExpand
Information Dynamics in Small-World Boolean Networks
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. Expand
Algebraic approach to asynchronous Boolean networks
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), deterministicExpand
Random Boolean Networks as a toy model for the brain
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 collectivelyExpand


Critical Values in Asynchronous Random Boolean Networks
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. Expand
Classification of Random Boolean Networks
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. Expand
Boolean Dynamics with Random Couplings
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 aExpand
Contextual Random Boolean Networks
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. Expand
Random Boolean networks response to external periodic signals
Random Boolean networks have been proposed as discrete models of genetic networks. Depending on the values of their control parameters, these networks fall by themselves in order or disorder phases.Expand
Boolean dynamics of networks with scale-free topology
The dynamics of Boolean networks with scale-free topology are studied. The existence of a phase transition from ordered to chaotic dynamics, governed by the value of the scale-free exponent of theExpand
Rhythmic and non-rhythmic attractors in asynchronous random Boolean networks
In multi-component, discrete systems, such as Boolean networks and cellular automata, the scheme of updating of the individual elements plays a crucial role in determining their dynamic propertiesExpand
Random networks of automata: a simple annealed approximation
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 BooleanExpand
Robust gene regulation: Deterministic dynamics from asynchronous networks with delay
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. Expand
Effects of alternative connectivity on behavior of randomly constructed Boolean networks
Random Boolean networks (RBNs) were first introduced and used to model regulatory gene networks by Kauffman in 1969 and since then have been frequently used to model networks at various levels ofExpand