Antichaos in a class of random Boolean cellular automata

DOI10.1016/0167-2789(93)90190-CzbMATH Open0794.68110arXivadap-org/9304001OpenAlexW1964570234MaRDI QIDQ1325879FDOQ1325879

James Lynch

Publication date: 5 June 1994

Published in: Physica D (Search for Journal in Brave)

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 $n$, are derived. If the bias approaches 0 slowly enough, the state cycles will be smaller than $n^c$ for some $c<1$. This lends support to Kauffman's claim that in his version of random network the average size of the state cycles is approximately $n^{1/2}$.

Full work available at URL: https://arxiv.org/abs/adap-org/9304001

zbMATH Keywords

cellular metabolismBoolean cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Topological dynamics (37B99)

Cites Work

• Title not available (Why is that?)
• Probability Distributions Related to Random Mappings
• Stability of vertices in random boolean cellular automata
• Parallel and sequential computation on Boolean networks

Cited In (3)

• Title not available (Why is that?)
• Median attractor and transients in random boolean nets
• On the threshold of chaos in random boolean cellular automata

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)