Abstract
We consider 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→∞.
| Original language | English |
|---|---|
| Pages (from-to) | 4793-4807 |
| Number of pages | 15 |
| Journal | Stochastic Processes and their Applications |
| Volume | 130 |
| Issue number | 8 |
| DOIs | |
| State | Published - Aug 2020 |
Keywords
- Cramer's theorem
- Cramér's theorem
- Legendre-Fenchel transform
- Legendre–Fenchel transform
- Random walk with reinforcement
All Science Journal Classification (ASJC) codes
- Applied Mathematics
- Statistics and Probability
- Modelling and Simulation
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver