Exact results for deterministic cellular automata traffic models
Henryk Fuks
Abstract
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to a well known lattice path counting problem. Assuming infinite lattice size and random initial configuration, the flow can be expressed in terms of generalized hypergeometric function. We show that the steady state limit agrees with previously published results.
Create a lesson
Related papers
A blueprint for the formalization of norm-variation of multiple ergodic averages for commuting transformations
Floris van Doorn, Polona Durcik, Joris Roos et al.
On some aspects of discrete groups acting ergodically on the boundary
Subhadip Dey, Mikołaj Frączyk, Sebastian Hurtado
A Structural Theory of Admissible Transitions in Biological Reaction Networks
Stephan Peter, Bashar Ibrahim
Sequential and distributive dual futile cycle: Hopf bifurcation can occur under parameter-rich kinetics but cannot occur under mass action kinetics
Nicola Vassena
Rigidity on the two-torus and Sarnak's conjecture
Yinshan Chang, Jian Wang, Junchang Zhou
Linear response for random systems with a cusp
Davrbek Oltiboev, Karim Rakhimov, Marks Ruziboev