Abstract

We consider random walks and queues where one or more of the underlying distributions are heavy-tailed, more precisely subexponential (e.g., the tails are regularly varying, DFR Weibull type or lognormal type). This contrast the standard light-tailed assumptions (for example in large deviations theory) where exponential moments are required. The problem is to derive asymptotic expressions for rare events like large random walk maxima or large cycle maxima, large waiting times or large sojourn time in a network, or excursions above a large level, and also to study the behaviour of the process leading to the occurence of the rare event. The results support the folklore that in the heavy-tailed case, rare events occur as consequence of one big jumpKeywordsRandom WalkRare EventHeavy TailExtremal IndexJackson NetworkThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.