arXiv · math/0610271
Tail asymptotics for the maximum of perturbed random walk
Abstract
Consider a random walk $S=(S_n:n\geq 0)$ that is ``perturbed'' by a stationary sequence $(ξ_n:n\geq 0)$ to produce the process $(S_n+ξ_n:n\geq0)$. This paper is concerned with computing the distribution of the all-time maximum $M_{\infty}=\max \{S_k+ξ_k:k\geq0\}$ of perturbed random walk with a negative drift. Such a maximum arises in several different applications settings, including production systems, communications networks and insurance risk. Our main results describe asymptotics for $\mathbb{P}(M_{\infty}>x)$ as $x\to\infty$. The tail asymptotics depend greatly on whether the $ξ_n$'s are light-tailed or heavy-tailed. In the light-tailed setting, the tail asymptotic is closely related to the Cramér--Lundberg asymptotic for standard random walk.
Explore related subjects
Keep this discovery
Victor F. Araman, Peter W. Glynn. 2006-10-09. Tail asymptotics for the maximum of perturbed random walk. https://doi.org/10.1214/105051606000000268
Cite the original work for its findings. Save a collection to share your selection of sources.