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
Physical and emergent nonpairwise interactions in oscillator networks: from higher-order phase reduction to coupling design
Riccardo Muolo, Hiroya Nakao, Christian Bick
Degree Growth of Iterates of Curves and Likely Intersections
Sina Saleh, Jit Wu Yap
Infinite prime sumsets in structured and Uk(Φ)-uniform sets
Felipe Hernández, Tristán Radić
Long-Lived Carpet-Like Transients in Time-Dependent Modular Discrete Laplacian Dynamics
Małgorzata Nowak-Kępczyk
SIPHy: Sparse identification of port-Hamiltonian systems from noisy data
Håkon Noren Myhr, Sølve Eidnes, J. Nathan Kutz
Extended dynamic mode decomposition with Fourier dictionaries: Error bounds and fast implementation
Felix Bartel, Sandra Ritter, Manuel Schaller et al.