Dynamics of finite inhomogeneous particle systems with exclusion interaction

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Malyshev, Vadim, Menshikov, Mikhail, Popov, Serguei, Wade, Andrew
Format: Preprint
Published: 2022
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909188766040064
author Malyshev, Vadim
Menshikov, Mikhail
Popov, Serguei
Wade, Andrew
author_facet Malyshev, Vadim
Menshikov, Mikhail
Popov, Serguei
Wade, Andrew
contents We study finite particle systems on the one-dimensional integer lattice, where each particle performs a continuous-time nearest-neighbour random walk, with jump rates intrinsic to each particle, subject to an exclusion interaction which suppresses jumps that would lead to more than one particle occupying any site. We show that the particle jump rates determine explicitly a unique partition of the system into maximal stable sub-systems, and that this partition can be obtained by a linear-time algorithm using only elementary arithmetic. The internal configuration of each stable sub-system possesses an explicit product-geometric limiting distribution, and the location of each stable sub-system obeys a strong law of large numbers with an explicit speed; the characteristic parameters of each stable sub-system are simple functions of the rate parameters for the corresponding particles. For the case where the entire system is stable, we provide a central limit theorem describing the fluctuations around the law of large numbers. Our approach draws on ramifications, in the exclusion context, of classical work of Goodman and Massey on partially-stable Jackson queueing networks.
format Preprint
id arxiv_https___arxiv_org_abs_2205_14990
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Dynamics of finite inhomogeneous particle systems with exclusion interaction
Malyshev, Vadim
Menshikov, Mikhail
Popov, Serguei
Wade, Andrew
Probability
60K35 (Primary) 60J27, 60K25, 90B22 (Secondary)
We study finite particle systems on the one-dimensional integer lattice, where each particle performs a continuous-time nearest-neighbour random walk, with jump rates intrinsic to each particle, subject to an exclusion interaction which suppresses jumps that would lead to more than one particle occupying any site. We show that the particle jump rates determine explicitly a unique partition of the system into maximal stable sub-systems, and that this partition can be obtained by a linear-time algorithm using only elementary arithmetic. The internal configuration of each stable sub-system possesses an explicit product-geometric limiting distribution, and the location of each stable sub-system obeys a strong law of large numbers with an explicit speed; the characteristic parameters of each stable sub-system are simple functions of the rate parameters for the corresponding particles. For the case where the entire system is stable, we provide a central limit theorem describing the fluctuations around the law of large numbers. Our approach draws on ramifications, in the exclusion context, of classical work of Goodman and Massey on partially-stable Jackson queueing networks.
title Dynamics of finite inhomogeneous particle systems with exclusion interaction
topic Probability
60K35 (Primary) 60J27, 60K25, 90B22 (Secondary)
url https://arxiv.org/abs/2205.14990