Controlled random walk with a target site
Abstract
We consider a simple random walk Wi in 1 or 2 dimensions, in which the walker may choose to stand still for a limited time. The time horizon is n, the maximum consecutive time steps which can be spent standing still is mn and the goal is to maximize P(Wn=0). We show that for dimension 1, if mn grows faster than ( n)2+γ for some γ>0, there is a strategy for each n such that P(Wn = 0) approaches 1. For dimension 2, if mn grows faster than a positive power of n then there are strategies keeping P(Wn=0) bounded away from 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.