Abstract: A dynamical system that belongs to the class introduced by A. P. Buslaev is investigated. The system contains \(N\) contours. There are two cells and one particle on each contour. For each contour there is one common point, called a node, with each of the neighboring nodes. In the deterministic version of the system, at any discrete moment, each particle moves to another cell if there is no delay. The delays are due to the fact that two particles cannot pass through the node at the same time. If two particles tend to cross the same node, then only one particle moves in accordance with a given rule of competition resolution. In the stochastic version the particle tends to move in a state corresponding to the state of the deterministic system in which the particle is moving. This attempt is implemented in the corresponding system with a probability of \(1-\varepsilon,\) where \(\varepsilon\) - is a small value. A rule for resolving competition, called the long cluster rule, is obtained, such that this rule puts the system in such a state that all particles move without delay at the present moment and in the future (the state of free movement), and the system gets into a state of motion in the shortest possible time. The average number of \(v_i\) displacements of a particle of the \(i\)-th contour per unit of time is called the average velocity of this particle, \(i=1,\dots,N.\) For the stochastic version of the system, the following is established under the assumption that \(N=3.\) For the long rule, the average particle velocities \(v_1=v_2=v_3=1-2\varepsilon+o(\varepsilon)\) \((\varepsilon\to 0).\) For the left-priority rule, according to which, in competition, the particle of the contour with the lower number has priority, the average particle velocity \(v_1=v_2=v_3=\frac{6}{7}+o(\sqrt{\varepsilon}).\)
Keywords: dynamical systems, cellular automata, random exclusion processes, traffic models.
For citation: Tatashev, A. G. and Yashina, M. V. The Optimal Competition Resolution Rule for a Controlled Binary Chain, Vladikavkaz Math. J., 2024, vol. 26, no. 1, pp.1421-153 (in Russian). DOI 10.46698/n5870-2157-0771-b
1. Schreckenberg, M., Shadshneider, M., Nagel, K. and Ito, N. Discrete Stochastic Models for Traffic Flow, Physical Review, 1995, vol. 51, no. 4, pp. 2939-2949. DOI: 10.1103/PhysRevE.51.2939.
2. Blank, M. L. Exact Analysis of Dynamical Systems Arising in Models
of Traffic Flow, Russian Mathematical Surveys, 2000, vol. 55, no. 3, pp. 562-563. DOI: 10.4213/rm95.
3. Belitsky, V. and Ferrari, P. A. Invariant Measures and Convergence Properties for Cellular Automation 184 and Related Processes, Journal of Statistical Physics, 2005, vol. 118, no. 3/4, pp. 589-523.
DOI: 10.1007/s10955-004-8822-4.
4. Gray, L. and Griffeath, D. The Ergodic Theory of Traffic Jams, Journal of Statistical Physics, 2001, vol. 105, no. 3/4, pp. 413-452.
DOI: 10.1023/A:1012202706850.
5. Kanai, M., Nishinary, K. and Tokihiro, T. Exact Solution and Asymptotic Behavior of the Asymmetric Simple Exclusion Process on a Ring, Journal of Physics A: Mathematical and General, 2006, vol. 39, no 29, 9071. DOI: 10.1088/0305-4470/39/29/004.
6. Kanai, M. Two-Lane Traffic-Flow Model with an Exact Steady-State Solution, Physical Review E, 2010, vol. 82, 066107. DOI: 10.1103/PhysRevE.82.066107.
7. Yashina, M. V. and Tatashev, A. G. Traffic Model Based on Synchronous and Asynchronous Exclusion Processes, Mathematical Methods in the Applied Sciences, 2018, vol. 43, no. 14, pp. 8136-8146. DOI: 10.1002/mma.6237.
8. Wolfram, S. Statistical Mechanics of Cellular Automata, Reviews of Modern Physics, 1983, vol. 55, no. 3, pp. 601-644. DOI: 10.1103/RevModPhys.55.601.
9. Spitzer, F. Interaction of Markov Processes, Advances in Mathematics,
1970, vol. 5, no. 2, pp. 246-290. DOI: 10.1016/0001-8708(70)90034-4.
10. Biham, O., Middleton, A. A. and Levine, D. Self-Organization and a Dynamic Transition in Traffic-Flow Models, Physical Review A, 1992, vol. 46, no. 10, pp. R6124-R6127. DOI: 10.1103/PhysRevA.46.R6124.
11. Angel, O., Horloyd, A. E. and Martin, J. B. The Jammed Phase of the Biham-Middelton-Levine Traffic Flow Model, Electronic Communication in Probability, 2005, vol. 10, pp. 167-178. DOI: 10.1214/ECP.V10-1148.
12. Moradi, H. R., Zardadi, A. and Heydarbeygi, Z. The Number of Collisions in Biham-Middleton-Levine Model on a Square Lattice with Limited Number of Cars, Applied Mathematics E-Notes, 2019, pp. 243-249.
13. Buslaev, A. P. and Yashina, M. V. On Holonomic Mathematical \(F\)-Pendulum, Mathematical Methods in the Applied Sciences, 2016, vol. 39, no. 16, pp. 4820-4828. DOI: 10.1002/mma.3810.
14. Bugaev, A. S., Buslaev, A. P., Kozlov, V. V. and Yashina, M. V. Distributed Problems of Monitoring and Modern Approaches to Traffic Modeling, 14th International IEEE Conference on Intelligent Transportation Systems
(ITSC), Washington, IEEE, 2011, pp. 477-481. DOI: 10.1109/ITSC.2011.6082805.
15. Kozlov, V. V., Buslaev, A. P. and Tatashev, A. G. On Synergy of Totally Connected Flows on Chainmails, Proceed. of International Conference of CMMSE, Spain, 2013, vol. 3, pp. 861-874.
16. Kozlov, V. V., Buslaev, A. P. and Tatashev, A. G. Monotonic Walks on a Necklace and a Coloured Dynamic Vector, International Journal of Computer Mathematics, 2015, vol. 92, no. 9, pp. 1910-1920. DOI: 10.1080/00207160.2014.915964.
17. Kozlov, V. V., Buslaev, A. P. and Tatashev, A. G. A Dynamic Communication System on a Network, Journal of Computational and Applied Mathemstics, 2015, pp. 247-261. DOI: 10.1016/j.cam.2014.07.026.
18. Tatashev, A. G. and Yashina, M. V. Spectrum of Elementary Cellular
Automata and Closed Chains of Contours, Machines, 2019, vol. 7, no. 2, pp. 28. DOI: 10.3390/machines7020028.
19. Buslaev, A. P., Fomina, M. Yu., Tatashev, A. G. and Yashina, M. V.
On Discrete Flow Networks Model Spectra: Statements, Simulation, Hypotheses, Journal of Physics: Conference Series, 2018, vol. 1053, 012034, pp. 1-7. DOI: 10.1088/1742/6596/1053/1/012034.
20. Bugaev, A. S., Tatashev, A. G. and Yashina, M. V. Spectrum of a Continuous Closed Symmetric Chain with an Arbitrary Number of Contours, Mathematical Models and Computer Simulations, 2021, vol. 13, no. 6, pp. 1014-1027.
DOI: 10.1134/S207004822106003X.
21. Yashina, M. V. and Tatashev, A. G. Spectral Cycles and Average Velocity of Clusters in Discrete Two-Contours System with Two Nodes, Mathematical Methods in the Applied Sciences, 2020, vol. 43, no. 7, pp. 4303-4316.
DOI: 10.1102/mma6194.
22. Yashina, M. V., Tatashev, A. G. and Fomina, M. Y.
Optimization of Velocity Mode in Buslaev Two-contour Networks via Competition Resolution Rules., International Journal of Interactive Mobile Technologies, 2020, vol. 14, no. 10, pp. 61-73. DOI: 103991/ijim.v14i10.14641
23. Myshkis, P. A., Tatashev, A. G. and Yashina, M. V.
Cluster Motion in a Two-Contour System with Priority Rule for Conflict Resolution, Journal of Computer and Systems Sciences International,
2020, vol. 59, no. 3, pp. 311-321. DOI: 10.1134/S1064230720030119.
24. Golovneva, E. V. On Ergodic Properties Homogeneous Markov Chains,
Vladikavkaz Math. J., 2012, vol. 14, no. 1, pp. 37-46 (in Russian).
DOI: 10.23671/VNC.2012.14.10952.
25. Kemeny, J. G. and Snell, J. L. Finite Markov Chains, New York, Berlin, Heidelberg, Tokyo, Springer-Verlag, 1976.