Visualising random boolean network dynamics

ABSTRACT

We propose a simple approach to visualising the time behaviour of Random Boolean Networks (RBNs), and demonstrate the approach by examining the effect of canalising functions for K > 2 networks.

REFERENCES

• 1: B. Drossel. Random boolean networks. In H. G. Schuster, editor, Reviews of Nonlinear Dynamics and Complexity, volume 1. Wiley, 2008. arXiv:0706.3351v2.
• 2: C. Gershenson. Introduction to random boolean networks. In Workshop and Tutorial Proceedings, ALife IX, pages 160--173, 2004.
• 3: Stuart A. Kauffman, Requirements for evolvability in complex systems: orderly dynamics and frozen components, Physica D, v.42 n.1-3, p.135-152, June 1990
• 4: S. A. Kauffman. The Origins of Order. OUP, 1993.
• 5: A. Wuensche. Genomic regulation modeled as a network with basins of attraction. Pacific Symposium on Biocomput., pages 89--102, 1998.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.3 COMPUTER GRAPHICS
      I.3.3 Picture/Image Generation
          Subjects: Display algorithms

General Terms:
Algorithms

Keywords:
RBNs, attractors, canalising functions, dynamical systems, random boolean networks