DYNAMICAL BEHAVIOR OF KAUFFMAN NETWORKS WITH AND-OR GATES

We study the parallel dynamics of a class of Kauffman boolean nets such that each vertex has a binary state machine {AND, OR} as local transition function. We have called this class of nets AON. In a finite, connected and undirected graph, the transient length, attractors and its basins of attraction are completely determined in the case of only OR (AND) functions in the net. For finite, connected and undirected AON, an exact linear bound is given for the transient time using a Lyapunov functional. Also, a necessary and sufficient condition is given for the diffusion problem of spreading a one all over the net, which generalizes the primitivity notion on graphs. This condition also characterizes its architecture. For finite, strongly connected and directed AON a non-polynomial time bound is given for the transient time and for the period on planar graphs, together with an example where this transient time and period are attained. Furthermore, on infinite but finite connected, directed and non planar AON we simulate an universal two-register machine, which allows us to exhibit universal computing capabilities.

[1]  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.

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

[3]  Christopher M. Bishop,et al.  Neural networks for pattern recognition , 1995 .

[4]  Geoffrey E. Hinton,et al.  Learning internal representations by error propagation , 1986 .

[5]  Eric Goles,et al.  Neural and automata networks , 1990 .

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

[7]  E. Goles.  Fixed Point Behavior of Threshold Functions on a Finite Set , 1982 .

[8]  D. Stauffer,et al.  Random Boolean networks: Analogy with percolation , 1987 .

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

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

[11]  R. Thomas,et al.  Logical analysis of systems comprising feedback loops. , 1978, Journal of theoretical biology.

[12]  J. Demongeot,et al.  POSITIVE REGULATION CIRCUITS AND MEMORY , 1999 .

[13]  R. Thomas,et al.  The role of feedback circuits: Positive feedback circuits are a necessary condition for positive real eigenvalues of the Jacobian matrix , 1994 .

[14]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

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

[16]  E. G. Chacc.  Comportement dynamique de réseaux d'automates , 1985 .

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

[18]  G. Weisbuch,et al.  Specific roles of the different boolean mappings in random networks , 1982 .

[19]  René Thomas,et al.  Kinetic logic : a Boolean approach to the analysis of complex regulatory systems : proceedings of the EMBO course "Formal analysis of genetic regulation," held in Brussels, September 6-16, 1977 , 1979 .

[20]  Eric Goles Ch.,et al.  Decreasing energy functions as a tool for studying threshold networks , 1985, Discret. Appl. Math..

[21]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[22]  E. Ch..  Dynamical Behaviour of Neural Networks , 1985 .

[23]  R. Goodstein,et al.  An introduction to the theory of numbers , 1961 .

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