Heavy-traffic analysis of the maximum of an asymptotically stable random walk

V. Shneer, V. Wachtel

Onderzoeksoutput: Boek/rapportRapportAcademic

45 Downloads (Pure)


For families of random walks {S(a)k } with ES(a) k = -ka <0 we consider their maxima M(a) = supk = 0 S(a)k . We investigate the asymptotic behaviour of M(a) as a ¿ 0 for asymptotically stable random walks. This problem appeared first in the 1960’s in the analysis of a single-server queue when the traffic load tends to 1 and since then is referred to as the heavy-traffic approximation problem. Kingman and Prokhorov suggested two different approaches which were later followed by many authors. We give two elementary proofs of our main result, using each of these approaches. It turns out that the main technical difficulties in both proofs are rather similar and may be resolved via a generalisation of the Kolmogorov inequality to the case of an infinite variance. Such a generalisation is also obtained in this note
Originele taal-2Engels
Plaats van productieEindhoven
Aantal pagina's9
StatusGepubliceerd - 2009

Publicatie series

NaamReport Eurandom
ISSN van geprinte versie1389-2355

Vingerafdruk Duik in de onderzoeksthema's van 'Heavy-traffic analysis of the maximum of an asymptotically stable random walk'. Samen vormen ze een unieke vingerafdruk.

Citeer dit