SearcharxivSearch

arXiv · 2206.14694

Squirrels can remember little: A random walk with jump reversals induced by a discrete-time renewal process

Abstract

We consider a class of discrete-time random walks with directed unit steps on the integer line. The direction of the steps is reversed at the time instants of events in a discrete-time renewal process and is maintained at uneventful time instants. This model represents a discrete-time semi-Markovian generalization of the telegraph process. We derive exact formulae for the propagator using generating functions. We prove that for geometrically distributed waiting times in the diffusive limit, this walk converges to the classical telegraph process. We consider the large-time asymptotics of the expected position: For waiting time densities with finite mean the walker remains in the average localized close to the departure site whereas escapes for fat-tailed waiting-time densities (i.e. densities with infinite mean) by a sublinear power-law. We explore anomalous diffusion features by accounting for the `aging effect' as a hallmark of non-Markovianity where the discrete-time version of the `aging renewal process' comes into play. By deriving pertinent distributions of this process we obtain explicit formulae for the variance when the waiting-times are Sibuya-distributed. In this case and generally for fat-tailed waiting time PDFs a $t^2$-ballistic superdiffusive scaling emerges in the large time limit. In contrast if the waiting time PDF between the step reversals is light-tailed (`narrow' with finite mean and variance) the walk exhibits normal diffusion and for `broad' waiting time PDFs (with finite mean and infinite variance) superdiffusive large time scaling. We also consider time-changed versions where the walk is subordinated to a continuous-time point process such as the time-fractional Poisson process. This defines a new class of biased continuous-time random walks exhibiting several regimes of anomalous diffusion.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas M. Michelitsch, Federico Polito, Alejandro P. Riascos. 2022-06-29. Squirrels can remember little: A random walk with jump reversals induced by a discrete-time renewal process. https://doi.org/10.1016/j.cnsns.2022.107031

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