ANTICHAOS IN A CLASS OF RANDOM BOOLEAN CELLULAR-AUTOMATA

被引:4
作者
LYNCH, JF
机构
[1] Department of Mathematics and Computer Science, Clarkson University, Potsdam
来源
PHYSICA D | 1993年 / 69卷 / 1-2期
基金
美国国家科学基金会;
关键词
D O I
10.1016/0167-2789(93)90190-C
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. For any c>0, if the bias approaches 0 slowly enough, the state cycles will be smaller than n(c).
引用
收藏
页码:201 / 208
页数:8
相关论文
共 7 条