SearcharxivSearch

arXiv · 2406.19383

Asymptotic Properties of Generalized Elephant Random Walks

Abstract

Elephant random walk is a special type of random walk that incorporates the memory of the past to determine its future steps. The probability of this walk taking a particular step (+1 or -1) at a time point, conditioned on the entire history, depends on a linear function of the proportion of steps of that type till that time point. In this work, we consider a generalization of the elephant random walk where we investigate how the dynamics of the random walk will change if we replace this linear function with a generic map satisfying some analytic conditions. We propose a new model, called the multidimensional generalized elephant random walk, that includes several variants of elephant random walk in one and higher dimensions and generalizations thereof. Using tools from the theory of stochastic approximation, we derive the asymptotic behavior of our model leading to newer results on the phase transition boundary between diffusive and non-diffusive regimes. In the process, we extend some results on one-dimensional stochastic approximation process, which can be of independent interest. We also mention a few open problems in this context.

Explore related subjects

Keep this discovery

BibTeXRIS

Krishanu Maulik, Parthanil Roy, Tamojit Sadhukhan. 2024-06-27. Asymptotic Properties of Generalized Elephant Random Walks. https://arxiv.org/abs/2406.19383

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