The need for speed : Maximizing random walks speed on fixed environments
Abstract
We study nearest neighbor random walks on fixed environments of Z composed of two point types : (1/2,1/2) and (p,1-p) for p>1/2. We show that for every environment with density of p drifts bounded by λ we have n→∞Xnn≤ (2p-1)λ, where Xn is a random walk on the environment. In addition up to some integer effect the environment which gives the best speed is given by equally spaced drifts.
0
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.