Upper and Lower Bounds on the Speed of a One Dimensional Excited Random Walk
Abstract
Excited random walks (ERWs) are a self-interacting non-Markovian random walk in which the future behavior of the walk is influenced by the number of times the walk has previously visited its current site. We study the speed of the walk, defined as V = n → ∞ Xnn where Xn is the state of the walk at time n. While results exist that indicate when the speed is non-zero, there exists no explicit formula for the speed. It is difficult to solve for the speed directly due to complex dependencies in the walk since the next step of the walker depends on how many times the walker has reached the current site. We derive the first non-trivial upper and lower bounds for the speed of the walk. In certain cases these upper and lower bounds are remarkably close together.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.