Critical behaviour of number-conserving cellular automata with nonlinear fundamental diagrams

We investigate critical properties of a class of number-conserving cellular automata (CAs) which can be interpreted as deterministic models of traffic flow with anticipatory driving. These rules are among the only known CA rules for which the shape of the fundamental diagram has been rigorously derived. In addition, their fundamental diagrams contain nonlinear segments, as opposed to the majority of number-conserving CAs which exhibit piecewise-linear diagrams. We found that the nature of singularities in the fundamental diagram of these rules is the same as for rules with piecewise-linear diagrams. The current converges toward its equilibrium value as t−1/2, and the critical exponent β is equal to unity. This supports the conjecture of universal behaviour at singularities in number-conserving rules. We discuss properties of phase transitions occurring at singularities as well as properties of the intermediate phase.

[1]  A. Schadschneider,et al.  Statistical physics of vehicular traffic and some related systems , 2000, cond-mat/0007053.

[2]  Henryk Fuks,et al.  A class of cellular automata equivalent to deterministic particle systems , 2002, nlin/0207047.

[3]  Pablo A. Ferrari,et al.  Invariant Measures and Convergence Properties for Cellular Automaton 184 and Related Processes , 2005 .

[4]  Katsunobu Imai,et al.  Number-Conserving Reversible Cellular Automata and Their Computation-Universality , 2001, RAIRO Theor. Informatics Appl..

[5]  H. Fuks,et al.  Cellular automaton rules conserving the number of active sites , 1997, adap-org/9712003.

[6]  D. Helbing Traffic and related self-driven many-particle systems , 2000, cond-mat/0012229.

[7]  Michael Blank Ergodic Properties of a Simple Deterministic Traffic Flow Model , 2002 .

[8]  N. Boccara,et al.  Critical behaviour of a cellular automaton highway traffic model , 2000 .

[9]  Tuomas J. Lukka,et al.  Solutions for certain number-conserving deterministic cellular automata. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Nino Boccara,et al.  Generalized Deterministic Traffic Rules , 1997, adap-org/9705003.

[11]  Andrés Moreira,et al.  Universality and decidability of number-conserving cellular automata , 2003, Theor. Comput. Sci..

[12]  H Fukś,et al.  Exact results for deterministic cellular automata traffic models. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[13]  T. Nagatani Creation and annihilation of traffic jams in a stochastic asymmetric exclusion model with open boundaries: a computer simulation , 1995 .

[14]  Krug,et al.  Universality classes for deterministic surface growth. , 1988, Physical review. A, General physics.

[15]  Enrico Formenti,et al.  Number conserving cellular automata II: dynamics , 2003, Theor. Comput. Sci..

[16]  Katsuhiro Nishinari,et al.  Analytical properties of ultradiscrete Burgers equation and rule-184 cellular automaton , 1998 .

[17]  T. Hattori,et al.  Additive conserved quantities in discrete-time lattice dynamical systems , 1991 .

[18]  Joachim Krug,et al.  A Cellular Automaton Model for Two-Lane Traffic , 2001 .

[19]  M. Pivato Conservation Laws in Cellular Automata , 2001, math/0111014.

[20]  Katsuhiro Nishinari,et al.  Euler-lagrange correspondence of cellular automaton for traffic-flow models. , 2003, Physical review letters.

[21]  Nagel Particle hopping models and traffic flow theory. , 1996, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[22]  Capcarrere,et al.  Two-state, r=1 Cellular Automaton that Classifies Density. , 1996, Physical review letters.

[23]  H. Fuks,et al.  Convergence to equilibrium in a class of interacting particle systems evolving in discrete time. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Enrico Formenti,et al.  Number-conserving cellular automata I: decidability , 2003, Theor. Comput. Sci..