Exact solution of Kauffman's model with connectivity one

Kauffman's model is a randomly assembled network of Boolean automata. Each automaton receives inputs from at most K other automata. Its state at discrete time t+1 is determined by a randomly chosen, but fixed, Boolean function of the K inputs at time t. The resulting quenched, random dynamics of the network demonstrates two phases: a frozen and a chaotic phase. The authors give an exact solution of the model for connectivity K=1, valid everywhere in the frozen phase and at a critical point, valid for finite as well as for infinite networks. They discuss the network's critical behaviour and finite-size effects. The results for the frozen phase presented complement recent exact results for the chaotic phase obtained for K= infinity .

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

[2]  Bernard Derrida,et al.  The random map model: a disordered model with deterministic dynamics , 1987 .

[3]  M. Mézard,et al.  Replica symmetry breaking and the nature of the spin glass phase , 1984 .

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

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

[6]  Françoise Fogelman-Soulié,et al.  Disordered Systems and Biological Organization , 1986, NATO ASI Series.

[7]  Bernard Derrida,et al.  Statistical properties of randomly broken objects and of multivalley structures in disordered systems , 1987 .

[8]  B. Derrida,et al.  Evolution of overlaps between configurations in random Boolean networks , 1986 .

[9]  Sample to sample fluctuations in the random energy model , 1985 .

[10]  Eric Goles Ch.,et al.  Transient length in sequential iteration of threshold functions , 1983, Discret. Appl. Math..

[11]  Bernard Derrida,et al.  Multivalley structure in Kauffman's model: analogy with spin glasses , 1986 .

[12]  Françoise Fogelman-Soulié Frustration and stability in random boolean networks , 1984, Discret. Appl. Math..

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

[14]  S. Kauffman Emergent properties in random complex automata , 1984 .

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

[16]  H. Hilhorst,et al.  On the approach of the stationary state in Kauffman's random Boolean network , 1987 .

[17]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[18]  M. A. Virasoro,et al.  Random free energies in spin glasses , 1985 .

[19]  Tsutomu Kamimura,et al.  Total Objects of Domains , 1984, Theor. Comput. Sci..

[20]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.