SearcharxivSearch

arXiv · math/0509066

Random Walk in Dynamic Markovian Random Environment

Abstract

We consider a model, introduced by Boldrighini, Minlos and Pellegrinotti, of random walks in dynamical random environments on the integer lattice Z^d with d>=1. In this model, the environment changes over time in a Markovian manner, independently across sites, while the walker uses the environment at its current location in order to make the next transition. In contrast with the cluster expansions approach of Boldrighini, Minlos and Pellegrinotti, we follow a probabilistic argument based on regeneration times. We prove an annealed SLLN and invariance principle for any dimension, and provide a quenched invariance principle for dimension d > 7, providing for d>7 an alternative to the analytical approach of Boldrighini, Minlos and Pellegrinotti, with the added benefit that it is valid under weaker assumptions. The quenched results use, in addition to the regeneration times already mentioned, a technique introduced by Bolthausen and Sznitman.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antar Bandyopadhyay, Ofer Zeitouni. 2006-03-28. Random Walk in Dynamic Markovian Random Environment. https://arxiv.org/abs/math/0509066

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