Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sufficient Loading Conditions for Self-organization in the nn-dimensional Version of BML Model with Stochastic Direction Choice

Published 3 Oct 2023 in math.OC | (2310.02291v1)

Abstract: A dynamical system is considered, which comprises an nn-dimensional lattice N1×N2×⋯×NnN_1 \times N_2 \times \dots \times N_n with periodic boundary conditions. Particles traverse this lattice following a variant of the Biham--Middleton--Levine (BML) traffic model's particle movement rules. We have proved that the BML model, when treated as a dynamical system, constitutes a specialized class of a Buslaev net. This equivalence allows us to employ established Buslaev net analysis techniques to investigate the BML model. In Buslaev nets conception the self-organization property of the system corresponds to the existance of velocity single point spectrum equal to 1. One notable aspect of the model under consideration is that particles can change their type with a certain probability. For simplicity, we assume a constant probability qq that a particle changes type at each step. In the l case where q=0q=0, the system corresponds to the classical version of the BML model. We define a state of the system where all particles continue to move indefinitely, both in the present and the future, as a state of free movement. A sufficient condition for the system to result in a state of free movement from any initial state (condition for self-organization) has been found. This condition is that the number of particles be not greater than half the greatest common divisor of the numbers N1N_1 N2,…,Nn.N_2,\dots,N_n.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.