| | |
| | |
Stat |
Members: 3645 Articles: 2'506'133 Articles rated: 2609
26 April 2024 |
|
| | | |
|
Article overview
| |
|
Phase Transitions in Random Boolean Networks with Different Updating Schemes | Carlos Gershenson
; | Date: |
5 Nov 2003 | Subject: | Adaptation and Self-Organizing Systems; Cellular Automata and Lattice Gases; Computational Complexity; Statistical Mechanics; Quantitative Methods | nlin.AO cond-mat.stat-mech cs.CC nlin.CG q-bio.QM | Abstract: | 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. | Source: | arXiv, nlin.AO/0311008 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |