Response of Boolean networks to perturbations

Abstract

We evaluate the probability that a Boolean network returns to an attractor after perturbing h nodes. We find that the return probability as function of h can display a variety of different behaviours, which yields insights into the state-space structure. In addition to performing computer simulations, we derive analytical results for several types of Boolean networks, in particular for Random Boolean Networks. We also apply our method to networks that have been evolved for robustness to small perturbations, and to a biological example.

References in corpus (6)

• The Yeast Cell-Cycle Network Is Robustly Designed
• Stable and unstable attractors in Boolean networks
• The dynamics of critical Kauffman networks under asynchronous stochastic update
• Scaling in critical random Boolean networks
• Evolution of Canalizing Boolean Networks
• Numerical and Theoretical Studies of Noise Effects in the Kauffman Model

Cited by in corpus (2)

• Perturbation propagation in random and evolved Boolean networks
• Noise in random Boolean networks