2003/11/05 by Carlos Gershenson, Gershenson, Carlos
Biochemistry, Genetics and Molecular Biology · Computer Science · Physics and Astronomy · #Adaptation and Self-Organizing Systems (nlin.AO) #Cellular Automata and Lattice Gases (nlin.CG) #Computational Complexity (cs.CC) #FOS: Biological sciences #FOS: Computer and information sciences #FOS: Physical sciences #Quantitative Methods (q-bio.QM) #Statistical Mechanics (cond-mat.stat-mech) #cond-mat.stat-mech #cs.CC #nlin.AO #nlin.CG #q-bio.QM
paper · pdf · doi:10.48550/arxiv.nlin/0311008
More info and better images at http://homepages.vub.ac.be/~cgershen/rbn
arxiv created 2003/11/05 · arxiv updated 2009/12/01
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.