Noise reinforcement for L\'evy processes
Abstract
In a step reinforced random walk, at each integer time and with a fixed probability p ∈ (0, 1), the walker repeats one of his previous steps chosen uniformly at random, and with complementary probability 1 -- p, the walker makes an independent new step with a given distribution. Examples in the literature include the so-called elephant random walk and the shark random swim. We consider here a continuous time analog, when the random walk is replaced by a L\'evy process. For sub-critical (or admissible) memory parameters p < p c , where p c is related to the Blumenthal-Getoor index of the L\'evy process, we construct a noise reinforced L\'evy process. Our main result shows that the step-reinforced random walks corresponding to discrete time skeletons of the L\'evy process, converge weakly to the noise reinforced L\'evy process as the time-mesh goes to 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.