The Speed of a Random Walk Excited By Its Recent History
Abstract
Let N and M be positive integers satisfying 1 M N, and let 0<p0<p1<1. Define a process \Xn\n=0∞ on Z as follows. At each step, the process jumps either one step to the right or one step to the left, according to the following mechanism. For the first N steps, the process behaves like a random walk that jumps to the right with probability p0 and to the left with probability 1-p0. At subsequent steps the jump mechanism is defined as follows: if at least M out of the N most recent jumps were to the right, then the probability of jumping to the right is p1; however, if fewer than M out of the N most recent jumps were to the right, then the probability of jumping to the right is p0. We calculate the speed of the process. Then we let N∞ and MN r∈[0,1], and calculate the limiting speed. More generally, we consider the above questions for a random walk with a finite number l of threshold levels, (Mi,pi)i=1l, above the pre-threshold level p0, as well as for one model with l=N such thresholds.
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.