Antichaos in a class of random Boolean cellular automata
From MaRDI portal
(Redirected from Publication:1325879)
Abstract: A variant of Kauffman's model of cellular metabolism is presented. It is a randomly generated network of boolean gates, identical to Kauffman's except for a small bias in favor of boolean gates that depend on at most one input. The bias is asymptotic to 0 as the number of gates increases. Upper bounds on the time until the network reaches a state cycle and the size of the state cycle, as functions of the number of gates , are derived. If the bias approaches 0 slowly enough, the state cycles will be smaller than for some . This lends support to Kauffman's claim that in his version of random network the average size of the state cycles is approximately .
Recommendations
Cites work
Cited in
(7)- Median attractor and transients in random boolean nets
- Invariant cycles in the random mapping of N integers onto themselves. Comparison with Kauffman binary network
- Stability of vertices in random boolean cellular automata
- scientific article; zbMATH DE number 32624 (Why is no real title available?)
- On the threshold of chaos in random boolean cellular automata
- scientific article; zbMATH DE number 861650 (Why is no real title available?)
- Critical points for random Boolean networks
This page was built for publication: Antichaos in a class of random Boolean cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1325879)