SearcharxivSearch

arXiv · 1708.08576

On the Speed of an Excited Asymmetric Random Walk

Abstract

An excited random walk is a non-Markovian extension of the simple random walk, in which the walk's behavior at time $n$ is impacted by the path it has taken up to time $n$. The properties of an excited random walk are more difficult to investigate than those of a simple random walk. For example, the limiting speed of an excited random walk is either zero or unknown depending on its initial conditions. While its limiting speed is unknown in most cases, the qualitative behavior of an excited random walk is largely determined by a parameter $\delta$ which can be computed explicitly. Despite this, it is known that the limiting speed cannot be written as a function of $\delta$. We offer a new proof of this fact, and use techniques from this proof to further investigate the relationship between $\delta$ and speed. We also generalize the standard excited random walk by introducing a "bias" to the right, and call this generalization an excited asymmetric random walk. Under certain initial conditions we are able to compute an explicit formula for the limiting speed of an excited asymmetric random walk.

Explore related subjects

Keep this discovery

BibTeXRIS

Mike Cinkoske, Joe Jackson, Claire Plunkett. 2017-08-29. On the Speed of an Excited Asymmetric Random Walk. https://arxiv.org/abs/1708.08576

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