On the approach of the stationary state in Kauffman's random Boolean network
暂无分享,去创建一个
Kauffman's model is a Boolean network having k quenched random connections per node, and evolving deterministically in time according to a quenched random rule. For a systems of N nodes we consider a time domain 0≤t ≤ tN, with $$ tN = ∞. It is shown (i) that in this limit the average overlap between two arbitrary initial states rigorously obeys an equation first derived by Derrida and Pomeau, and (ii) that for k ≤ 2 each state evolves, in a weak sense, to a fixed point state. Also, (iii) upper bounds on the finite size corrections are obtained. Lastly, (iv) for k =1 the exact time-dependent pair overlap is found and compared to the results (i)-(iii).
[1] S. Kauffman. Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.
[2] S. Wolfram. Statistical mechanics of cellular automata , 1983 .
[3] Stephen Wolfram,et al. Universality and complexity in cellular automata , 1983 .
[4] B. Derrida,et al. Evolution of overlaps between configurations in random Boolean networks , 1986 .
[5] B. Derrida,et al. Random networks of automata: a simple annealed approximation , 1986 .