2000 character limit reached
Limit theorems for a random walk with memory perturbed by a dynamical system (2005.07288v4)
Published 14 May 2020 in math.PR
Abstract: We introduce a new random walk with unbounded memory obtained as a mixture of the Elephant Random Walk and the Dynamic Random Walk which we call the Dynamic Elephant Random Walk (DERW). As a consequence of this mixture the distribution of the increments of the resulting random process is time dependent. We prove a strong law of large numbers for the DERW and, in a particular case, we provide an explicit expression for its speed. Finally, we give sufficient conditions for the central limit theorem and the law of the iterated logarithm to hold.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.