SearcharxivSearch

arXiv · 1711.07713

Invariant measures of discrete interacting particle systems: Algebraic aspects

Abstract

Consider a continuous time particle system $η^t=(η^t(k),k\in \mathbb{L})$, indexed by a lattice $\mathbb{L}$ which will be either $\mathbb{Z}$, $\mathbb{Z}/n\mathbb{Z}$, a segment $\{1,\cdots, n\}$, or $\mathbb{Z}^d$, and taking its values in the set $E_κ^{\mathbb{L}}$ where $E_κ=\{0,\cdots,κ-1\}$ for some fixed $κ\in\{\infty, 2,3,\cdots\}$. Assume that the Markovian evolution of the particle system (PS) is driven by some translation invariant local dynamics with bounded range, encoded by a jump rate matrix $T$. These are standard settings, satisfied by the TASEP, the voter models, the contact processes... The aim of this paper is to provide some sufficient and/or necessary conditions on the matrix $T$ so that this Markov process admits some simple invariant distribution, as a product measure (if $\mathbb{L}$ is any of the spaces mentioned above), as the law of a Markov process indexed by $\mathbb{Z}$ or $[0,n]\cap \mathbb{Z}$ (if $\mathbb{L}=\mathbb{Z}$ or $\{1,\cdots,n\}$), or a Gibbs measure if $\mathbb{L}=\mathbb{Z}/n\mathbb{Z}$. Multiple applications follow: efficient ways to find invariant Markov laws for a given jump rate matrix or to prove that none exists. The voter models and the contact processes are shown not to possess any Markov laws as invariant distribution (for any memory $m$) Footnote: As usual, a random process $X$ indexed by $\mathbb{Z}$ or $\mathbb{N}$ is said to be a Markov chain with memory $m\in\{0,1,2,\cdots\}$ if for $\mathbb{P}(X_k \in A ~| X_{k-i}, i \geq 1)= \mathbb{P}(X_k \in A ~| X_{k-i}, 1\leq i\leq m)$, for any $k$.}. We also prove that some models close to these models do. We exhibit PS admitting hidden Markov chains as invariant distribution and design many PS on $\mathbb{Z}^2$, with jump rates indexed by $2\times 2$ squares, admitting product invariant measures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luis Fredes, Jean-François Marckert. 2019-01-10. Invariant measures of discrete interacting particle systems: Algebraic aspects. https://arxiv.org/abs/1711.07713

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