Phase Transitions in Random Boolean Networks with Different Updating Schemes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this paper we study the phase transitions of different types of Random Boolean networks. These differ in their updating scheme: synchronous, semi-synchronous, or asynchronous, and deterministic or non-deterministic. It has been shown that the statistical properties of Random Boolean networks change considerable according to the updating scheme. We study with computer simulations sensitivity to initial conditions as a measure of order/chaos. We find that independently of their updating scheme, all network types have very similar phase transitions, namely when the average number of connections of nodes is between one and three. This critical value depends more on the size of the network than on the updating scheme.
More info and better images at http://homepages.vub.ac.be/~cgershen/rbn

Keywords

Adaptation and Self-Organizing Systems, Statistical Mechanics, Computational Complexity, Cellular Automata and Lattice Gases, Quantitative Methods

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/80594

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/nlin/0311008
 http://arxiv.org/abs/nlin/0311008

Collections

arXiv