On cellular automata, traffic and dynamical systems in graphs

  • Authors

    • Buslaev Alexander P
    • Tatashev Alexander G
    • Yashina Marina V.
    2018-05-16
    https://doi.org/10.14419/ijet.v7i2.28.13210
  • Dynamical Systems, Cellular Automaton, Wolfram Automata, Regular Networks, Traffic Flow.

  • Abstract

    Qualitative studies of discrete dynamical systems behavior on networks are relevant in many fields such as system biology, transportation, information traffic, material sciences and so on. We consider cellular automata on one-dimensional and two-dimensional toroidal supporters. At every discrete time moment, each cell of a cellular automaton is in one of two states 0 and 1. We introduce concept of the cellular automaton mass at fixed time. The cellular automaton mass is the quantity of cells such that these cells are in the state 1. The mass conservation law takes place if the mass of cellular automaton is the same at every time. Concepts of explosion and annihilation have been introduced. Explosion takes place if the mass of cellular automaton increases at each iteration until all cells are in the state 1. Annihilation takes place if the mass of cellular automaton decreases at each iteration until all cells are in the state 0. We consider classes of cellular automata such that the state of cell at the next time depends on the state at current time and states of neighboring cells belonging to fixed set. We have found sets of cellular automata such that the mass conservation law, explosion or annihilation takes place for these automata.

     

  • References

    1. [1] Von Neumann J. 1963. The general and logical theory of automata. In J. von Neumann, Collected works, edited by A.H. Taub, 288.

      [2] Von Neumann J. 1966. Theory of self-reproducing automata, edited by A.W. Burks (University of Illions, Urnana).

      [3] Ulam S. Some ideas and prospects in bio-mathematics. Ann.Rev.Bio. 255 (1974).

      [4] Berlekamp E.R., Conway J.H., Gay R.K. Winning ways for your mathematical plays. A.K. Peters Ltd, 2001-2004. 4 vols.

      [5] Wolfram S. Cellular Automata as Simple Self-Organizing Systems. California Institute of Technology, Pasadena CA 91125 (July 1982; revised November 1982)

      [6] Manna Z. Mathematical Theory of Computation, McGraw-Hill, 1974.

      [7] Wolfram S. Cellular automata as models of complexity. Nature. International Weekly Journal of Science, 311:5985 (1984), 419- 424.

      [8] Wolfram S. Tables of cellular automata properties. In â€Theory and applications of cellular automata (included selected papers 1983–1986)â€[Wolfram~S. (Ed.)]. Advanced Series on Complex Systems. World Scientific Publishing, pp.~485–557, 1986.

      [9] Martin O., Odlyzko A.M., Wolfram S. Algebraic Properties of Cellular Automata. Communications in Mathematical Physics, 93:2 (1984), 219-258.

      [10] Pickard N.H. Wolfram S. Two-dimensional cellular automata. Journal of Statistics Physics, 38:5/6 (1985), 901-946.

      [11] Biham O., Middleton A.A., Levine D. Self-organization and a dynamical transition in traffic flow models. Phys. Rev. A. American Physical Society,. 46:10 (1992), R6124-R6127.

      [12] Belitzky V., Ferrary P.A. Invariant measures and convergence properties for cellular automation 184 and related processes. Journal of Statistical Physics, 118:3 (2005), 589-623.

      [13] Blank M.L. Exact analysis of dynamical systems arising in models of traffic flow. Russian Mathematical Surveys, 2000, 55:3, 562-563.

      [14] Gray L., Griffeath D. The ergodic theory of traffic jams, J. Stat. Phys., 3:4 (2001), 413-452.

      [15] Buslaev A.P., Gasnikov A.V. , Yashina M.V. Selected Mathematical Problems of Traffic Flow Theory. International Journal of Computer Mathematics. 89: 3 (2012), 409-432.

      [16] Kozlov V. V., Buslaev A. P. , Tatashev. A. G. A Dynamical Communication System on a Network. Journal of Computational and Applied Mathematics, 275 (2015), 257-261.

      [17] D’Souza R.M. Coexisting phases and lattice dependence of a cellular automaton model for traffic flow. Phys. Rev. E., 71:6 (2005), 066112.

      [18] Angel, Omer; Holroyd, Alexander E.; Martin, James B. (12 August 2005). "The Jammed Phase of the Biham - Middleton - Levine Traffic Model". Electronic Communications in Probability. 10, 167 - 178.

      [19] Austin T., Benjamini I. For what number of cars must self organization occur in the Biham - Middleton - Levine traffic model from any possible starting configuration/ (2006). arXiv: math/0607759.

      [20] Kozlov V.V., Buslaev A.P., Tatashev A.G. Monotonic random walks and clusters flows on networks. Models and applications, Lambert Academician Publishing, Saarbrucken, Germany, 2013, no. 78724.

      [21] Buslaev A.P., Tatashev A.G. Exact results for discrete dynamical systems on a pair of contours. Mathematical Methods in the Applied Sciences. (To appear)

      [22] Kozlov V.V., Buslaev A.P., Tatashev A.G. On real-valued oscillations of a bipendulum. Applied Mathematics Letters, 2015, 46, 44 - 49.

      [23] Buslaev A.P., Tatashev A.G. On dynamical systems for transport logistic and communications. J. Math. Res., 2016, 8:4, 195 - 210.

      [24] Buslaev A.P., Tatashev A.G. Bernoulli algebra on common fractions and generalized oscillations. J. Math. Res., 8:3 (2016), 82 - 95.

      [25] Buslaev A.P., Yashina M. V. On holonomic mathematical F-pendulum. Mathematical Methods in the Applied Sciences,39:16 (2016), 4820 – 4828.

  • Downloads

  • How to Cite

    Alexander P, B., Alexander G, T., & Marina V., Y. (2018). On cellular automata, traffic and dynamical systems in graphs. International Journal of Engineering & Technology, 7(2.28), 351-356. https://doi.org/10.14419/ijet.v7i2.28.13210

    Received date: 2018-05-23

    Accepted date: 2018-05-23

    Published date: 2018-05-16