The speed of a general random walk reinforced by its recent history
classification
🧮 math.PR
keywords
speedhistoryprocessrandomrecentaverageclassconsider
read the original 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\to\infty$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.