论文信息 - On forcing functions in Kauffman's random Boolean networks - 字舞流文

On forcing functions in Kauffman's random Boolean networks

The phase transition between frozen and chaotic behavior in Kauffman's cellular automata on a nearest neighbor square lattice does not agree with the percolation threshold of the forcing functions.

Dietrich Stauffer

[1] Françoise Fogelman-Soulié,et al. Parallel and Sequential Computation on Boolean Networks , 1985, Theor. Comput. Sci..

[2] B. Derrida,et al. Phase Transitions in Two-Dimensional Kauffman Cellular Automata , 1986 .

[3] S. Kauffman. Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.

[4] B. Derrida,et al. Random networks of automata: a simple annealed approximation , 1986 .

[5] Gérard Weisbuch,et al. Phase transition in cellular random Boolean nets , 1987 .

[6] S. Redner,et al. Introduction To Percolation Theory , 2018 .

[7] S. Wolfram. Statistical mechanics of cellular automata , 1983 .

[8] H. Hartman,et al. Inhomogeneous Cellular Automata (INCA) , 1986 .