SearcharxivSearch

arXiv · 2302.00971

Couplings and attractiveness for general exclusion processes

Abstract

Attractiveness is a fundamental tool to study interacting particle systems and the basic coupling construction is a usual route to prove this property, as for instance in the simple exclusion process. We consider here general exclusion processes where jump rates from an occupied site to an empty one depend not only on the location of the jump but also possibly on the whole configuration. These processes include in particular exclusion processes with speed change introduced by F. Spitzer in [18]. For such processes we derive necessary and sufficient conditions for attractiveness, through the construction of a coupled process under which discrepancies do not increase. We emphasize the fact that basic coupling is never attractive for this class of processes, except in the case of simple exclusion, and that the coupled processes presented here necessarily differ from it. We study various examples, for which we determine the set of extremal translation invariant and invariant probability measures.

Explore related subjects

Keep this discovery

BibTeXRIS

Thierry Gobron, Ellen Saada. 2023-02-02. Couplings and attractiveness for general exclusion processes. https://arxiv.org/abs/2302.00971

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