SearcharxivSearch

arXiv · 2201.05175

Stationary States of the One-Dimensional Discrete-Time Facilitated Symmetric Exclusion Process

Abstract

We describe the extremal translation invariant stationary (ETIS) states of the facilitated exclusion process on $\mathbb{Z}$. In this model all particles on sites with one occupied and one empty neighbor jump at each integer time to the empty neighbor site, and if two particles attempt to jump into the same empty site we choose one randomly to succeed. The ETIS states are qualitatively different for densities $\rho<1/2$, $\rho=1/2$, and $1/2<\rho<1$, but in each density region we find states which may be grouped into families, each of which is in natural correspondence with the set of all ergodic measures on $\{0,1\}^{\mathbb{Z}}$. For $\rho<1/2$ there is one such family, containing all the ergodic states in which the probability of two adjacent occupied sites is zero. For $\rho=1/2$ there are two families, in which configurations translate to the left and right, respectively, with constant speed 2. For the high density case there is a continuum of families. We show that all ETIS states at densities $\rho\le1/2$ belong to these families, and conjecture that also at high density there are no other ETIS states. We also study the possible ETIS states which might occur if the conjecture fails.

Explore related subjects

Keep this discovery

BibTeXRIS

S. Goldstein, J. L. Lebowitz, E. R. Speer. 2022-01-13. Stationary States of the One-Dimensional Discrete-Time Facilitated Symmetric Exclusion Process. https://doi.org/10.1063/5.0085528

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR