Randomized Cellular Automata
Nino Boccara
Abstract
We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined on random directed graphs with constant out-degrees and evolve according to cellular automaton rules. For some families of rules, a few typical a priori unexpected results are presented.
Create a lesson
Related papers
Optical free space extreme learning machine for the implementation of emergent complex systems
Elena Moreno, Fernando Soldevila, Daniel Torrent
The istr-graph: Interactive Visualisation of any Classic-Graph in DDLab
Andrew Wuensche
Game of Life on Archimedean Lattices: Glider Guns and Phase Dynamics
Henrik Schou Guttesen
Dynamics in a Low-Rank Separable Field Cellular Automaton
Xiaorui Shi, Mengsha Huang
Trigonometric Plot of Ising Model
Goktug Islamoglu
Kramers-Wannier Duality at the Heart of Traffic
Goktug Islamoglu