Algebraic and Geometric Aspects of Flow Modeling and Prospects of Natural Science Applications

  • Valery V. Kozlov
  • Boris N. Chetverushkin
  • Alexander P. Buslaev
  • Alexander G. Tatashev
  • Marina V. YashinaEmail author
Conference paper


Every modern applied direction of natural-scientific research has access to a lot of data of network information—big data. These trends make it possible to assume higher standards for information processing and quality of developing models. In addition to using in traffic modeling applications, models of particle flows on complex networks are applied in different areas. The areas are, for example, material science for design of new materials, study of biological processes (metabolism), medicine for the study of drug action , computing (supercomputers), etc.

We consider regular networks being perturbation of standard rectangular networks or other regular graphs, where vertices are replaced with contours as support of the local movement of particles. The movement rules are postulated. Qualitative and quantitative flow characteristics are studied.

The BML model of cellular automata on Manhattan network on a torus was considered. There are two types of particles moving in one direction. The particles of first type move along meridians, and the particles of second type move along parallels. For the first time there was obtained an effect of self-organization of the system, and collapse conditions were formulated. The BML authors laid down the foundation of the spectral theory for the considered systems.

We are developing models of flows in more general periodic symmetric structures. There are proved results about particles velocities. Conditions of self-organization and collapse of the system have been formulated.

We consider a variant of general algebraic formulation for full graph with architecture of N-dial. The particle plans are given by recording of real number in N-ary number system. The results characterized by the quality behavior of the system have been obtained. We have developed approaches to evaluate the velocity of the plan implementation by the particle and value of intensity of the particle movement. Various generalizations of the considered statements are formulated. Interconnection of these problems with questions of classical branches of mathematics has been found, in particular, with the theory of Diophantine equations.


  1. 1.
    Austin, T.D., Benjamint, I.: For what number of cars must self organization occur in the Biham–Middleton–Levine traffic model, 2006, arXive:math/0607759 [math.CO]Google Scholar
  2. 2.
    Biham, O., Middleton, A., Levine, D.: Self-organization and a dynamical transition in traffic-flow models. Phys. Rev. A 46, 10 (1992)CrossRefGoogle Scholar
  3. 3.
    Blank, M.L.: Exact analysis of dynamical systems arising in models of traffic flows. Russ. Math. Surv. 55(3), 562–563 (2000). CrossRefGoogle Scholar
  4. 4.
    Blank, M.: Metric properties of discrete time exclusion type exclusion time processes in continuum. J. Stat. Phys. 140, 170–197 (2010)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Bugaev, A.S., Buslaev, A.P., Kozlov, V.V., Tatashev, A.G., Yashina, M.V.: Traffic modeling: monotonic total-connected random walk on a network. Matematicheskoye Modelirovanie 25(8), 3–21 (2013) (In Russian)zbMATHGoogle Scholar
  6. 6.
    Bugaev, A.S., Buslaev, A.P., Kozlov, V.V., Tatashev, A.G., Yashina, M.V.: Generalized transport-logistic problem as a class of dynamical systems. Matematicheskoye Modelirovanie 27(12), 65–87 (2015) (In Russian)zbMATHGoogle Scholar
  7. 7.
    Buslaev, A.P., Tatashev, A.G.: Generalized real numbers pendulums and transport logistic applications. New Developments in Pure and Applied Mathematics. New Developments in Pure and Applied Mathematics, pp. 388–392. Vienna (2015).
  8. 8.
    Buslaev, A.P., Tatashev, A.G.: Flows on discrete traffic flow. J. Math. Res. 9(1), 98–108 (2016). CrossRefGoogle Scholar
  9. 9.
    Buslaev, A.P., Tatashev, A.G.: Bernoulli algebra on common fractions and generalized oscillations. J. Math. Res. 8(3), 82–95 (2016) CrossRefGoogle Scholar
  10. 10.
    Buslaev, A.P., Tatashev, A.G.: On dynamical systems for transport logistic and communications. J. Math. Res. 8(8), 195–210 (2016). CrossRefGoogle Scholar
  11. 11.
    Buslaev, A.P., Tatashev, A.G., Yashina, M.V.: Qualitative properties of dynamical system on toroidal chainmail. 11th International Conference of Numerical Analysis Mathematics 2013, ICNAAM 2013, Rhodes, Greece, 21–27 September 2013. AIP Conference Proceedings 1558, pp. 1144–1147 (2013)CrossRefGoogle Scholar
  12. 12.
    Chetverushkin, B.N.: High-performance multiprocess systems: problems of using and personnel training. Vestnik RAN 72(9), 786–794 (2000) (In Russian)Google Scholar
  13. 13.
    Chetverushkin, B.N.: Kinetic models for solving continuum mechanic problems on supercomputers. Math. Models Comput. Simul. 7(6), 531–539 (2015)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Chetverushkin, B.N., Saveliev, V.I.: Kinetic models and High-performance calculations. Preprints of Keldysh Institute of Applied Mathematics. RAS, Moscow (2015), 079 (In Russian)Google Scholar
  15. 15.
    Ding, Z., Jiang, R., Wang, B.: Traffic flow in the Biham–Middleton–Levine model with random update rule. Phys. Rev. 83(4) (2011)Google Scholar
  16. 16.
    Katzgraben, H.G., Hamse, F., Andrist, S.R.: Glassy chimeras could be blind to quantum speedup: designing better benchmakers for quantum speedup for quantum annealing machines. Phys. Rev. X. 4, 1–8 (2014) Google Scholar
  17. 17.
    Kozlov, V.V., Buslaev, A.P., Tatashev, A.G.: On synergy of totally connected flows on chainmails. Proceedings of the 13th International Conference on Computational and Mathematical Methods in Science and Engineering, CMSSE 2013, Cadiz, Spain, June 24–27 2013, vol. 3, pp. 861–873 (2013)Google Scholar
  18. 18.
    Kozlov, V.V., Buslaev, A.P., Tatashev, A.G., Yashina, M.V.: Mathematical problems and theorems on saturated flows on chainmail. Traffic and Granular Flow ’13, 25–27 September 2013, Forschungzentrum, Julich, Germany. Book of Abstracts (2013)Google Scholar
  19. 19.
    Kozlov, V.V., Buslaev, A.P., Tatashev, A.G., Yashina, M.V.: Monotonic walks of particles on a chainmail and coloured matrices. Proceedings of the 14th International Conference on Computational and Mathematical Methods in Science and Engineering, CMSSE 2014, Cadiz, Spain, June 3–7 2014, vol. 3, pp. 801–805 (2014)Google Scholar
  20. 20.
    Kozlov, V.V., Buslaev, A.P., Tatashev, A.G.: Behavior of pendulums on a regular polygon. J. Commun. Comput. 11, 30–38 (2014)Google Scholar
  21. 21.
    Kozlov, V.V., Buslaev, A.P., Tatashev, A.G.: Monotonic walks on a necklace and coloured dynamic vector. Int. J. Comput. Math. 92(9), 1910–1920 (2015). MathSciNetCrossRefGoogle Scholar
  22. 22.
    Kozlov, V.V., Buslaev, A.P., Tatashev, A.G.: A dynamical communication system on a network. J. Comput. Appl. Math. 275, 247–261 (2015). MathSciNetCrossRefGoogle Scholar
  23. 23.
    Kozlov, V.V., Buslaev, A.P., Tatashev, A.G.: On real-valued oscillations of a bipendulum. Appl. Math. Lett. 46, 44–49 (2015) MathSciNetCrossRefGoogle Scholar
  24. 24.
    Kozlov, V.V., Buslaev, A.P., Tatashev, A.G., Yashina, M.V.: Dynamical Systems on Honeycombs. Traffic and Granular Flow ’13, pp. 441–452. Springer, Heidelberg (2015)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Valery V. Kozlov
    • 1
  • Boris N. Chetverushkin
    • 2
  • Alexander P. Buslaev
    • 3
  • Alexander G. Tatashev
    • 3
  • Marina V. Yashina
    • 3
    Email author
  1. 1.Steklov Mathematical Institute of the Russian Academy of SciencesMoscowRussia
  2. 2.Keldysh Institute of Applied Mathematics of the Russian Academy of SciencesMoscowRussia
  3. 3.Moscow Automobile and Road Construction State Technical University (MADI)MoscowRussia

Personalised recommendations