# Excited Random Walk

@article{Benjamini2003ExcitedRW,
title={Excited Random Walk},
author={Itai Benjamini and David Bruce Wilson},
journal={Electronic Communications in Probability},
year={2003},
volume={8},
pages={86-92}
}
• Published 22 February 2003
• Mathematics
• Electronic Communications in Probability
A random walk on $\mathbb{Z}^d$ is excited if the first time it visits a vertex there is a bias in one direction, but on subsequent visits to that vertex the walker picks a neighbor uniformly at random. We show that excited random walk on $\mathbb{Z}^d$ is transient iff $d > 1$.
106 Citations
Excited Random Walk on Trees
We consider a nearest-neighbor stochastic process on a rooted tree $G$ which goes toward the root with probability $1-\varepsilon$ when it visits a vertex for the first time. At all other times it
Excited random walk against a wall
• Mathematics
• 2005
We analyze random walk in the upper half of a three-dimensional lattice which goes down whenever it encounters a new vertex, a.k.a. excited random walk. We show that it is recurrent with an expected
Mutually excited random walks
• Mathematics
• 2012
Consider two random walks on $\mathbb{Z}$. The transition probabilities of each walk is dependent on trajectory of the other walker i.e. a drift $p>1/2$ is obtained in a position the other walker
Multi-excited random walks on integers
We introduce a class of nearest-neighbor integer random walks in random and non-random media, which includes excited random walks considered in the literature. At each site the random walker has a
Slowdown for the geodesic-biased random walk
• Mathematics
Electronic Communications in Probability
• 2019
Given a connected graph $G$ with some subset of its vertices excited and a fixed target vertex, in the geodesic-biased random walk on $G$, a random walker moves as follows: from an unexcited vertex,
Recurrence and transience of excited random walks on $Z^d$ and strips
We investigate excited random walks on $Z^d, d\ge 1,$ and on planar strips $Z\times{0,1,\ldots,L-1}$ which have a drift in a given direction. The strength of the drift may depend on a random i.i.d.
Random Walks with Local Memory
• Mathematics
Journal of Statistical Physics
• 2021
We prove a quenched invariance principle for a class of random walks in random environment on $\mathbb{Z}^d$, where the walker alters its own environment. The environment consists of an outgoing edge
Excited random walk in three dimensions has positive speed
Excited random walk is a random walk that has a positive drift to the right when it reaches a vertex it hasn't been to before. We show that in three dimensions the walk drifts to the right in
Long range one-cookie random walk with positive speed
• Mathematics
Stochastic Processes and their Applications
• 2021

## References

SHOWING 1-10 OF 25 REFERENCES
Reinforced Random Walk
This thesis aim is to present results on a stochastic model called reinforced random walk. This process was conceived in the late 1980’s by Coppersmith and Diaconis and can be regarded as a
Random Walks that Avoid Their Past Convex Hull
• Mathematics
• 2002
We explore planar random walk conditioned to avoid its past convex hull. We prove that it escapes at a positive lim sup speed. Experimental results show that fluctuations from a limiting direction
Some Problems on Random Walk in Space
• Mathematics
• 1951
Consider the lattice formed by all points whose coordinates are integers in d-dimensional Euclidean space, and let a point S j(n) perform a move randomly on this lattice according to the following
Law of the iterated logarithm for the range of random walks in two and three dimensions
• Mathematics
• 2002
Let S n be a random walk in Z d and let R n be the range of S n . We prove an almost sure invariance principle for R n when d = 3 and a law of the iterated logarithm for R n when d = 2.
Intersections of random walks
A more accurate title for this book would be "Problems dealing with the non-intersection of paths of random walks. " These include: harmonic measure, which can be considered as a problem of
Random walks and electric networks
• Mathematics
• 1984
The goal will be to interpret Polya’s beautiful theorem that a random walker on an infinite street network in d-dimensional space is bound to return to the starting point when d = 2, but has a positive probability of escaping to infinity without returning to the Starting Point when d ≥ 3, and to prove the theorem using techniques from classical electrical theory.
Walks on the slit plane
• Mathematics
• 2000
Abstract. In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the half-line . We call them walks on the slit plane. We
Brownian motion and random walk perturbed at extrema
Abstract Let bt be Brownian motion. We show there is a unique adapted process xt which satisfies dxt = dbt except when xt is at a maximum or a minimum, when it receives a push, the magnitudes and
Scaling limits of loop-erased random walks and uniform spanning trees
AbstractThe uniform spanning tree (UST) and the loop-erased random walk (LERW) are strongly related probabilistic processes. We consider the limits of these models on a fine grid in the plane, as the