Affiliation:
1. Department of Statistics and Operation Research, King Saud University, Riyadh 11451, Saudi Arabia
2. MODAL’X, UPL, University Paris Nanterre, CNRS, F92000 Nanterre, France
Abstract
We study a system of M particles with jump dynamics on a network of N sites. The particles can exist in two states, active or inactive. Only the former can jump. The state of each particle depends on its position. A given particle is inactive when it is at a given site, and active when it moves to a change site. Indeed, each sleeping particle activates at a rate λ>0, leaves its initial site, and moves for an exponential random time of parameter μ>0 before uniformly landing at a site and immediately returning to sleep. The behavior of each particle is independent of that of the others. These dynamics conserve the total number of particles; there is no limit on the number of particles at a given site. This system can be represented by a continuous-time Pólya urn with M balls where the colors are the sites, with an additional color to account for particles on the move at a given time t. First, using this Pólya interpretation for fixed M and N, we obtain the average number of particles at each site over time and, therefore, those on the move due to mass conservation. Secondly, we consider a large system in which the number of particles M and the number of sites N grow at the same rate, so that the M/N ratio tends to a scaling constant α>0. Using the moment-generating function technique added to some probabilistic arguments, we obtain the long-term distribution of the number of particles at each site.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference12 articles.
1. Popov, S.Y. (2003, January 7–12). Frogs and some other interacting random walks models. Proceedings of the Discrete Mathematics & Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France.
2. Giakkoupis, G., Mallmann-Trenn, F., and Saribekyan, H. (August, January 29). How to spread a rumor: Call your neighbors or take a walk?. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Toronto, ON, Canada.
3. On an epidemic model on finite graphs;Benjamini;Ann. Appl. Probab.,2020
4. Emergence of coherent structures and large-scale flows in motile suspensions;Saintillan;J. R. Soc. Interface,2012
5. Über zwei bekannte Einwände gegen das Boltzmannsche H-Theorem;Ehrenfest;Physik,1907