We have monitored by computer simulations quantities related to the spatial organization of random cellular Boolean nets during the limit cycles such as the local periods of automata, the global period of the whole net, and percolation of the oscillating structures, and shown that they obey a phase transition for the same value of the transition parameter as found by Derrida and Stauffer from overlaps between initially different configurations.Nous avons étudié par simulation sur ordinateur l'apparition de structures spatiales dans les cycles limites des réseaux aléatoires d'automates cellulaires Booléens. Ces mesures ont porté sur les périodes locales des automates comparées à la période globale du réseau et sur la percolation des structur...
We investigate the low-noise regime of a large class of probabilistic cellular automata, including t...
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initi...
Canalization is a property of Boolean automata that characterizes the extent to which subsets of inp...
We have monitored by computer simulations quantities related to the spatial organization of random c...
Résumé. 2014 Nous avons étudié par simulation sur ordinateur l’apparition de structures spatiales da...
International audienceIn the random Boolean networks suggested by Kauffman, each site is changed to ...
The two-dimensional random Boolean networks suggested by Kauffman have a transition to chaos. We fin...
International audienceCellular automata are a model of parallel computing. It is well known that sim...
We generate the critical condition for the phase transition of a Boolean network governed by partial...
Cellular automata are a model of parallel computing. It is well known that simple cellular automata ...
We outline the basic principles of neuropercolation, a generalized percolation model motivated by th...
We obtain the phase diagram of random Boolean networks with nested canalizing functions. Using the ...
Abstract. Cellular automata are both seen as a model of computation and as tools to model real life ...
The period of limit cycles, the time evolution of the distance between two initial configurations an...
We examine the collective dynamics of heterogeneous random networks of model neuronal cellular autom...
We investigate the low-noise regime of a large class of probabilistic cellular automata, including t...
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initi...
Canalization is a property of Boolean automata that characterizes the extent to which subsets of inp...
We have monitored by computer simulations quantities related to the spatial organization of random c...
Résumé. 2014 Nous avons étudié par simulation sur ordinateur l’apparition de structures spatiales da...
International audienceIn the random Boolean networks suggested by Kauffman, each site is changed to ...
The two-dimensional random Boolean networks suggested by Kauffman have a transition to chaos. We fin...
International audienceCellular automata are a model of parallel computing. It is well known that sim...
We generate the critical condition for the phase transition of a Boolean network governed by partial...
Cellular automata are a model of parallel computing. It is well known that simple cellular automata ...
We outline the basic principles of neuropercolation, a generalized percolation model motivated by th...
We obtain the phase diagram of random Boolean networks with nested canalizing functions. Using the ...
Abstract. Cellular automata are both seen as a model of computation and as tools to model real life ...
The period of limit cycles, the time evolution of the distance between two initial configurations an...
We examine the collective dynamics of heterogeneous random networks of model neuronal cellular autom...
We investigate the low-noise regime of a large class of probabilistic cellular automata, including t...
We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initi...
Canalization is a property of Boolean automata that characterizes the extent to which subsets of inp...