Attractors in continuous and Boolean networks

Abstract

We study the stable attractors of a class of continuous dynamical systems that may be idealized as networks of Boolean elements, with the goal of determining which Boolean attractors, if any, are good approximations of the attractors of generic continuous systems. We investigate the dynamics in simple rings and rings with one additional self-input. An analysis of switching characteristics and pulse propagation explains the relation between attractors of the continuous systems and their Boolean approximations. For simple rings, "reliable" Boolean attractors correspond to stable continuous attractors. For networks with more complex logic, the qualitative features of continuous attractors are influenced by inherently non-Boolean characteristics of switching events.

Revised and extended version. The methods section from version 2 is now an appendix and another appendix has been added. Submitted to PRE

References in corpus (8)

• Topology of biological networks and reliability of information processing
• Stable and unstable attractors in Boolean networks
• The dynamics of critical Kauffman networks under asynchronous stochastic update
• Canalizing Kauffman networks: non-ergodicity and its effect on their critical behavior
• Exhaustive percolation on random networks
• The properties of attractors of canalyzing random Boolean networks
• On the properties of cycles of simple Boolean networks
• Mean Field Model of Genetic Regulatory Networks

Cited by in corpus (8)

• Boolean Chaos
• On the Origin of Chaos in Autonomous Boolean Networks
• Ultra-Fast Physical Generation of Random Numbers Using Hybrid Boolean Networks
• Boolean versus continuous dynamics on simple two-gene modules
• Stability of Boolean and continuous dynamics
• Boolean modeling of collective effects in complex networks
• Robustness of Transcriptional Regulation in Yeast-like Model Boolean Networks
• Anomalies in the transcriptional regulatory network of the yeast Saccharomyces cerevisiae