Phase Transitions in Random Boolean Networks with Different Updating Schemes

Simple item page
dc.creatorGershenson, Carlos
dc.date2003-11-05
dc.date.accessioned2026-07-07T05:35:04Z
dc.date.available2026-07-07T05:35:04Z
dc.descriptionIn 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.
dc.descriptionMore info and better images at http://homepages.vub.ac.be/~cgershen/rbn
dc.identifierhttps://arxiv.org/abs/nlin/0311008
dc.identifierhttp://arxiv.org/abs/nlin/0311008
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/80594
dc.subjectAdaptation and Self-Organizing Systems
dc.subjectStatistical Mechanics
dc.subjectComputational Complexity
dc.subjectCellular Automata and Lattice Gases
dc.subjectQuantitative Methods
dc.titlePhase Transitions in Random Boolean Networks with Different Updating Schemes
dc.typetext

Files

Collections

arXiv