Random Networks of Automata: A Simple Annealed Approximation
- 15 January 1986
- journal article
- Published by IOP Publishing in Europhysics Letters
- Vol. 1 (2) , 45-49
- https://doi.org/10.1209/0295-5075/1/2/001
Abstract
Kauffman's model is a random complex automata where nodes are randomly assembled. Each node σi receives K inputs from K randomly chosen nodes and the values of σi at time t + 1 is a random Boolean function of the K inputs at time t. Numerical simulations have shown that the behaviour of this model is very different for K > 2 and K ≤ 2. It is the purpose of this work to give a simple annealed approximation which predicts K = 2 as the critical value of K. This approximation gives also quantitative predictions for distances between iterated configurations. These predictions agree rather well with the numerical simulations. A possible way of improving this annealed approximation is proposed.Keywords
This publication has 9 references indexed in Scilit:
- Metabolic stability and epigenesis in randomly constructed genetic netsPublished by Elsevier ,2004
- Phase transitions of cellular automataZeitschrift für Physik B Condensed Matter, 1985
- Frustration and stability in random boolean networksDiscrete Applied Mathematics, 1984
- Equivalence of Cellular Automata to Ising Models and Directed PercolationPhysical Review Letters, 1984
- Emergent properties in random complex automataPhysica D: Nonlinear Phenomena, 1984
- Statistical mechanics of cellular automataReviews of Modern Physics, 1983
- Neural networks and physical systems with emergent collective computational abilities.Proceedings of the National Academy of Sciences, 1982
- The large scale structure and dynamics of gene control circuitsJournal of Theoretical Biology, 1974
- Chapter 5 Gene Regulation Networks: A Theory For Their Global Structure and BehaviorsPublished by Elsevier ,1971