Remarks on the speeds of a class of random walks on the integers

Maher Boudabra; Greg Markowsky

Home/Archive/arXiv

arXiv · 2002.12529

Remarks on the speeds of a class of random walks on the integers

Maher Boudabra·Greg Markowsky

View original source ↗Read source document ↗Export metadata ↓

Abstract

In recent years, there has been an interest in deriving certain important probabilistic results as consequences of deterministic ones; see for instance \cite{beig} and \cite{acc}. In this work, we continue on this path by deducing a well known equivalence between the speed of random walks on the integers and the growth of the size of their ranges. This result is an immediate consequence of the Kesten-Spitzer-Whitman theorem, and by appearances is probabilistic in nature, but we will show that it follows easily from an elementary deterministic result. We also investigate the common property of recurrent random walks of having speed zero, and show by example that this property need not be shared by deterministic sequences. However, if we consider the inter-arrival times (times at which the sequence is equal to 0) then we find a sufficient deterministic condition for a sequence to have zero speed, and show that this can be used to derive several probabilistic results.

Explore related subjects

math.PR

Keep this discovery

BibTeX RIS

Maher Boudabra, Greg Markowsky. 2020-02-28. Remarks on the speeds of a class of random walks on the integers. https://arxiv.org/abs/2002.12529

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗