SearcharxivSearch

arXiv · 2605.17725

Limit theorems for random walks with spatio-temporal drift

Abstract

We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models of self-interacting random processes. We determine the asymptotic behavior of the walk under the assumption that its increments have moments of order $p$ for some $p>2$. In the linear case, where the drift depends linearly on the current position, we establish a phase transition in the convergence in distribution of the normalized process to Gaussian limits. In the nonlinear case, we identify three distinct regimes separated by a critical line and show that the normalized process exhibits qualitatively different behaviors in each regime, including convergence in distribution to a Gaussian law, convergence to a non-Gaussian limit given by the stationary distribution of a stochastic differential equation, and almost sure localization on a hypersphere.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ngo P. N. Ngoc, Tuan-Minh Nguyen. 2026-05-18. Limit theorems for random walks with spatio-temporal drift. https://arxiv.org/abs/2605.17725

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