SearcharxivSearch

arXiv · 1507.00778

Invariant measures of Mass Migration Processes

Abstract

We introduce the Mass Migration Process (MMP), a conservative particle system on ${\mathbb N}^{{\mathbb Z}^d}$. It consists in jumps of $k$ particles ($k\ge 1$) between sites, with a jump rate depending only on the state of the system at the departure and arrival sites of the jump. It generalizes misanthropes processes, hence in particular zero range and target processes. After the construction of MMP, our main focus is on its invariant measures. We obtain necessary and sufficient conditions for the existence of translation-invariant and invariant product probability measures. In the particular cases of asymmetric mass migration zero range and mass migration target dynamics, these conditions yield explicit solutions. If these processes are moreover attractive, we obtain a full characterization of all translation-invariant, invariant probability measures. We also consider attractiveness properties (through couplings) and condensation phenomena for MMP. We illustrate our results on many examples; in particular, we prove the coexistence of both condensation and attractiveness in one of them.

Explore related subjects

Keep this discovery

BibTeXRIS

Lucie Fajfrova, Thierry Gobron, Ellen Saada. 2015-07-02. Invariant measures of Mass Migration Processes. https://arxiv.org/abs/1507.00778

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