Papers
Topics
Authors
Recent
2000 character limit reached

On a class of random walks with reinforced memory (1909.04633v2)

Published 10 Sep 2019 in math.PR and cond-mat.stat-mech

Abstract: This paper deals with different models of random walks with a reinforced memory of preferential attachment type. We consider extensions of the Elephant Random Walk introduced by Sch\"utz and Trimper [2004] with a stronger reinforcement mechanism, where, roughly speaking, a step from the past is remembered proportional to some weight and then repeated with probability $p$. With probability $1-p$, the random walk performs a step independent of the past. The weight of the remembered step is increased by an additive factor $b\geq 0$, making it likelier to repeat the step again in the future. A combination of techniques from the theory of urns, branching processes and $\alpha$-stable processes enables us to discuss the limit behavior of reinforced versions of both the Elephant Random Walk and its $\alpha$-stable counterpart, the so-called Shark Random Swim introduced by Businger [2018]. We establish phase transitions, separating subcritical from supercritical regimes.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.