Critical Kauffman networks under deterministic asynchronous update

Abstract

We investigate the influence of a deterministic but non-synchronous update on Random Boolean Networks, with a focus on critical networks. Knowing that ``relevant components'' determine the number and length of attractors, we focus on such relevant components and calculate how the length and number of attractors on these components are modified by delays at one or more nodes. The main findings are that attractors decrease in number when there are more delays, and that periods may become very long when delays are not integer multiples of the basic update step.

8 pages, 3 figures, submitted to a journal

References in corpus (14)

• The Yeast Cell-Cycle Network Is Robustly Designed
• Random Boolean Network Models and the Yeast Transcriptional Network
• Scaling in ordered and critical random Boolean networks
• Stable and unstable attractors in Boolean networks
• Stability of the Kauffman Model
• Self-organized Networks of Competing Boolean Agents
• Relevant elments, Magnetization and Dynamical Properties in Kauffman Networks: a Numerical Study
• The dynamics of critical Kauffman networks under asynchronous stochastic update
• The Modular Structure of Kauffman Networks
• On the number of attractors in random Boolean networks
• Scaling in critical random Boolean networks
• Scaling in a general class of critical random Boolean networks
• The properties of attractors of canalyzing random Boolean networks
• On the properties of cycles of simple Boolean networks

Cited by in corpus (2)

• Network inference using asynchronously updated kinetic Ising Model
• Avalanches, branching ratios, and clustering of attractors in Random Boolean Networks and in the segment polarity network of \emph{Drosophila}