SearcharxivSearch

arXiv · 1305.7242

The Speed of a Random Walk Excited By Its Recent History

Abstract

Let $N$ and $M$ be positive integers satisfying $1\le M\le N$, and let $0<p_0<p_1<1$. Define a process $\{X_n\}_{n=0}^\infty$ on $\mathbb{Z}$ as follows. At each step, the process jumps either one step to the right or one step to the left, according to the following mechanism. For the first $N$ steps, the process behaves like a random walk that jumps to the right with probability $p_0$ and to the left with probability $1-p_0$. At subsequent steps the jump mechanism is defined as follows: if at least $M$ out of the $N$ most recent jumps were to the right, then the probability of jumping to the right is $p_1$; however, if fewer than $M$ out of the $N$ most recent jumps were to the right, then the probability of jumping to the right is $p_0$. We calculate the speed of the process. Then we let $N\to\infty$ and $\frac MN\to r\in[0,1]$, and calculate the limiting speed. More generally, we consider the above questions for a random walk with a finite number $l$ of threshold levels, $(M_i,p_i)_{i=1}^l$, above the pre-threshold level $p_0$, as well as for one model with $l=N$ such thresholds.

Explore related subjects

Keep this discovery

BibTeXRIS

Ross G. Pinsky. 2014-02-09. The Speed of a Random Walk Excited By Its Recent History. https://arxiv.org/abs/1305.7242

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