The speed of a general random walk reinforced by its recent history
Abstract
We consider several variants of a class of random walks whose increment distributions depend on the average value of the process over its most recent N steps. We investigate the speed of the process, and in particular, the limiting speed as the "history window" N∞.
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.