Lyapunov Exponents in Random Boolean Networks

Abstract

A new order parameter approximation to Random Boolean Networks (RBN) is introduced, based on the concept of Boolean derivative. A statistical argument involving an annealed approximation is used, allowing to measure the order parameter in terms of the statistical properties of a random matrix. Using the same formalism, a Lyapunov exponent is calculated, allowing to provide the onset of damage spreading through the network and how sensitive it is to minimal perturbations. Finally, the Lyapunov exponents are obtained by means of different approximations: through distance method and a discrete variant of the Wolf's method for continuous systems.

16 pages, 5 eps-figures included, article submitted to Physica A

References in corpus (5)

• Damage spreading and Lyapunov exponents in cellular automata
• Closing probabilities in the Kauffman model: an annealed computation
• Synchronization and Maximum Lyapunov Exponents of Cellular Automata
• Boolean derivatives and computation of cellular automata
• On Damage Spreading Transitions

Cited by in corpus (22)

• Complexity and Information: Measuring Emergence, Self-organization, and Homeostasis at Multiple Scales
• Logic and connectivity jointly determine criticality in biological gene regulatory networks
• Introduction to Random Boolean Networks
• Complex and Adaptive Dynamical Systems: A Primer
• Canalizing Kauffman networks: non-ergodicity and its effect on their critical behavior
• Edge of chaos and avalanches in neural networks with heavy-tailed synaptic weight distribution
• Chaotic Gene Regulatory Networks Can Be Robust Against Mutations and Noise
• Temporal, structural, and functional heterogeneities extend criticality and antifragility in random Boolean networks
• Modularity and the spread of perturbations in complex dynamical systems
• Self-Organized Critical Random Boolean Networks
• The phase diagram of random Boolean networks with nested canalizing functions
• Modular Random Boolean Networks
• A Comprehensive Taxonomy of Cellular Automata
• Lyapunov Exponents for Temporal Networks
• Heterogeneity extends criticality
• Set-based complexity and biological information
• State Concentration Exponent as a Measure of Quickness in Kauffman-type Networks
• Phase transitions of extended-range probabilistic cellular automata with two absorbing states
• Nested canalizing functions minimize sensitivity and simultaneously promote criticality
• Self-overlap as a method of analysis in Ising models
• Dynamical systems analysis of stack filters
• Dynamical regimes in non-ergodic random Boolean networks