Matsievsky S. (Baltic Federal University. I. Kant (Kaliningrad))
Drozdetsky S. (Baltic Federal University. I. Kant (Kaliningrad))
Tarnovsky P. (Baltic Federal University. I. Kant (Kaliningrad))
Yurkov P. (Baltic Federal University. I. Kant (Kaliningrad))
Muzychin V. (Baltic Federal University. I. Kant (Kaliningrad))
Dubinin I. (Baltic Federal University. I. Kant (Kaliningrad))
|
Use of ergodicity for traffic flow simulation is proved. The terms of a concept of ergodicity are considered. Ergodic Theorem as justification of statistical properties of a measurable space group action is discussed. Zermelo paradox is discussed. A proof of Poincare recurrence theorem is provided. Use of numerical methods of convex function minimization is proved.
Keywords:simulation, traffic flow, ergodicity, Ergodic Theorem, Poincare recurrence theorem, Zermelo paradox, convex function minimization.
|
|
|
Read the full article …
|
Citation link: Matsievsky S. , Drozdetsky S. , Tarnovsky P. , Yurkov P. , Muzychin V. , Dubinin I. About ergodicity for simulation of traffic flows of a large city // Современная наука: актуальные проблемы теории и практики. Серия: Естественные и Технические Науки. -2019. -№04. -С. 70-75 |
|
|