STABILITY OF VERTICES IN RANDOM BOOLEAN CELLULAR AUTOMATA

被引：8

作者：

LUCZAK, T ^{[1
]}

COHEN, JE ^{[1
]}

机构：

[1] ADAM MICKIEWICZ UNIV,INST MATH,PL-60769 POZNAN,POLAND

来源：

RANDOM STRUCTURES & ALGORITHMS | 1991年 / 2卷 / 03期

关键词：

D O I：

10.1002/rsa.3240020307

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Based on computer simulations, Kauffman (Physica D, 10, 145-156, 1984) made several generalizations about a random Boolean cellular automation which he invented as a model of cellular metabolism. Here we give the first rigorous proofs of two of Kauffman's generalizations: a large fraction of vertices stabilize quickly, consequently the length of cycles in the automaton's behavior is small compared to that of a random mapping with the same number of states; and reversal of the states of a large fraction of the vertices does not affect the cycle to which the automaton moves.

引用

页码：327 / 334

页数：8

共 7 条

[1]

Bollobas B., 1985, RANDOM GRAPHS

[2] EVOLUTION OF OVERLAPS BETWEEN CONFIGURATIONS IN RANDOM BOOLEAN NETWORKS [J].