Asymptotics for the maximum of a modulated random walk with heavy-tailed increments
Sergey Foss, Stan Zachary

TL;DR
This paper investigates the asymptotic behavior of the maximum of a modulated random walk with heavy-tailed increments, especially when the modulating process is regenerative, and also examines related recursive maxima.
Contribution
It provides new asymptotic results for the maximum of modulated heavy-tailed random walks and recursive processes with regenerative modulating processes.
Findings
Derived asymptotic formulas for the maximum of the modulated random walk.
Analyzed the maximum of the recursive process with regenerative modulating process.
Extended existing theories to include heavy-tailed increments in modulated settings.
Abstract
We consider asymptotics for the maximum of a modulated random walk whose increments are heavy-tailed. Of particular interest is the case where the modulating process is regenerative. Here we study also the maximum of the recursion given by and, for ,
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
