Probabilistic cellular automata with conserved quantities
Henryk Fukś
Abstract
We demonstrate that the concept of a conservation law can be naturally extended from deterministic to probabilistic cellular automata (PCA) rules. The local function for conservative PCA must satisfy conditions analogous to conservation conditions for deterministic cellular automata. Conservation condition for PCA can also be written in the form of a current conservation law. For deterministic nearest-neighbour CA the current can be computed exactly. Local structure approximation can partially predict the equilibrium current for non-deterministic cases. For linear segments of the fundamental diagram it actually produces exact results.
Create a lesson
Related papers
A repeating sequence of simple rules creates a universal computer
Riz Fernando Noronha
Analytical derivation of a three-dimensional fundamental diagram for a real-valued max-plus particle system
Daisuke Takahashi, Junta Matsukidaira, Kazuya Okamoto
Diagonal Bases and Diagonal Periods of Elementary Cellular Automata
Tigran Nersissian
Diagonal Periods and Newton Supports of Rules 30, 86 and 135
Tigran Nersissian
Gliders on Aperiodic Monotilings: Cellular Automata on the Hat and Spectre
James Edmond
Optical free space extreme learning machine for the implementation of emergent complex systems
Elena Moreno, Fernando Soldevila, Daniel Torrent