Excited Random Walk

Abstract

A random walk on 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 Z^d, is transient iff d>1.

7 pages, v2 is journal version

References in corpus (1)

• Walks on the slit plane

Cited by in corpus (26)

• Depletion-Controlled Starvation of a Diffusing Forager
• Recurrence and transience for the frog model on trees
• Excited Random Walk in One Dimension
• Molecular Spiders with Memory
• Role of Depletion on the Dynamics of a Diffusing Forager
• On a general many-dimensional excited random walk
• Universality classes of foraging with resource renewal
• Limit laws of transient excited random walks on integers
• Random walkers with extreme value memory: modelling the peak-end rule
• Greedy walk on the real line
• Monotonicity and regularity of the speed for excited random walks in higher dimensions
• Greedy Random Walk
• Stability of the Greedy Algorithm on the Circle
• Range-controlled random walks
• Transience/Recurrence and the speed of a one-dimensional random walk in a "have your cookie and eat it" environment
• Excited random walk with periodic cookies
• On range and local time of many-dimensional submartingales
• Solution manifold and Its Statistical Applications
• Random walks with local memory
• Random walks avoiding their convex hull with a finite memory
• Forager with intermittent rest: Better for survival?
• Recurrence of horizontal-vertical walks
• Long range one-cookie random walk with positive speed
• Does Partial Consumption Help Foraging?
• Upper and Lower Bounds on the Speed of a One Dimensional Excited Random Walk
• Speed of excited random walks with long backward steps