SearcharxivSearch

arXiv · 1609.07066

Random walks in non homogeneous Poissonian environment

Abstract

We consider the moving particle process in Rd which is defined in the following way. There are two independent sequences (Tk) and (dk) of random variables. The variables Tk are non negative and form an increasing sequence, while variables dk form an i.i.d sequence with common distribution concentrated on the unit sphere. The values dk are interpreted as the directions, and Tk as the moments of change of directions. A particle starts from zero and moves in the direction d1 up to the moment T1 . It then changes direction to d2 and moves on within the time interval T2 minus T1 , etc. The speed is constant at all sites. The position of the particle at time t is denoted by X(t). We suppose that the points (Tk) form a non homogeneous Poisson point process and we are interested in the global behavior of the process (X(t)), namely, we are looking for conditions under which the processes (Y(T,t), T is non negative), Y(T,t) is X(tT) normalized by B(T), t in (0, 1), weakly converges in C(0, 1) to some process Y when T tends to infinity. In the second part of the paper the process X(t) is considered as a Markov chain. We construct diffusion approximations for this process and investigate their accuracy. The main tool in this part is the paramertix method.

Explore related subjects

Keep this discovery

BibTeXRIS

Youri Davydov, Valentin Konakov. 2016-09-22. Random walks in non homogeneous Poissonian environment. https://arxiv.org/abs/1609.07066

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