Summary
International Symposium on Nonlinear Theory and its Applications
2005
Session Number:3-1-2
Session:
Number:3-1-2-5
Criticality in Random Boolean Networks
Thomas Ott, Martin Frey, Ruedi Stoop,
pp.549-552
Publication Date:2005/10/18
Online ISSN:2188-5079
Summary:
Boolean networks are considered generic models for a large class of asymmetric networks, such as neural networks or gene regulatory networks. Previous work has shown that such networks undergo a phase transition from an ordered to a ’chaotic’ phase as various network parameters (e.g., the connectivity) are changed. Several contributions have established the idea that the network’s computational abilities are best near this order-chaos transition. Here, we investigate the stability of the order-chaos transition in the presence of noise and give an upper bound noise level for critically tuned networks that may support an optimal computation. Our studies, however, also reveal shortcomings of the used approaches concerning questions of natural computation.