SearcharxivSearch

arXiv · 1911.01401

Polynomial ballisticity conditions in mixing environments

Abstract

We prove ballistic behaviour as well as an annealed functional central limit theorem for random walks in mixing random environments (RWRE). The ballistic hypothesis will be an effective polynomial condition as the one introduced by Berger, Drewitz, and Ram\'{\i}rez (\emph{Comm. Pure Appl. Math,} {\bf 67}, (2014) 1947--1973). The novel idea therein was the construction of several simultaneous renormalization steps, providing more flexibility for seed estimates. For our proof, we indeed follow a similar path, and introduce a new mixing effective criterion which will be implied by the polynomial condition. This allows us to prove, in a mixing framework, the RWRE conjecture concerning the equivalence between each condition $(T^\gamma)|\ell$, for $\gamma\in (0,1)$ and $\ell \in \mathbb S^{d-1}$. This work complements the previous work of Guerra (\emph{Ann. Probab.} {\bf 47} (2019) 3003--3054) and completes the answer about the meaning of condition $(T')|\ell$ in a mixing setting, an open question posed by Comets and Zeitouni (\emph{Ann. Probab.} {\bf 32} (2004) 880--914).

Explore related subjects

Keep this discovery

BibTeXRIS

Enrique Guerra, Glauco Valle, Maria Eulalia Vares. 2019-11-04. Polynomial ballisticity conditions in mixing environments. https://arxiv.org/abs/1911.01401

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