Exact results for deterministic cellular automata traffic models

Simple item page
dc.creatorFuks, Henryk
dc.date1999-04-12
dc.date.accessioned2026-07-07T05:28:54Z
dc.date.available2026-07-07T05:28:54Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/9904182
dc.identifierhttp://arxiv.org/abs/math/9904182
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78438
dc.subjectDynamical Systems
dc.titleExact results for deterministic cellular automata traffic models
dc.typetext

Files

Collections

arXiv