Asymptotics for the maximum of a modulated random walk with heavy-tailed increments
Abstract
We consider asymptotics for the maximum of a modulated random walk whose increments nXn are heavy-tailed. Of particular interest is the case where the modulating process X is regenerative. Here we study also the maximum of the recursion given by W0=0 and, for n1, Wn=(0,Wn-1+nXn)
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.