SearcharxivSearch

arXiv · 2203.04196

On the elephant random walk with stops playing hide and seek with the Mittag-Leffler distribution

Abstract

The aim of this paper is to investigate the asymptotic behavior of the so-called elephant random walk with stops (ERWS). In contrast with the standard elephant random walk, the elephant is allowed to be lazy by staying on his own position. We prove that the number of ones of the ERWS, properly normalized, converges almost surely to a Mittag-Leffler distribution. It allows us to carry out a sharp analysis on the asymptotic behavior of the ERWS. In the diffusive and critical regimes, we establish the almost sure convergence of the ERWS. We also show that it is necessary to self-normalized the position of the ERWS by the random number of ones in order to prove the asymptotic normality. In the superdiffusive regime, we establish the almost sure convergence of the ERWS, properly normalized, to a nondegenerate random variable. Moreover, we also show that the fluctuation of the ERWS around its limiting random variable is still Gaussian.

Explore related subjects

Keep this discovery

BibTeXRIS

Bernard Bercu. 2022-03-08. On the elephant random walk with stops playing hide and seek with the Mittag-Leffler distribution. https://doi.org/10.1007/s10955-022-02980-w

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