Tail asymptotics for the maximum of perturbed random walk
Abstract
Consider a random walk that is ``perturbed'' by a stationary sequence to produce the process . This paper is concerned with computing the distribution of the all-time maximum 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 as . The tail asymptotics depend greatly on whether the 's are light-tailed or heavy-tailed. In the light-tailed setting, the tail asymptotic is closely related to the Cram\'{e}r--Lundberg asymptotic for standard random walk.
Cite
@article{arxiv.math/0610271,
title = {Tail asymptotics for the maximum of perturbed random walk},
author = {Victor F. Araman and Peter W. Glynn},
journal= {arXiv preprint arXiv:math/0610271},
year = {2007}
}
Comments
Published at http://dx.doi.org/10.1214/105051606000000268 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)