Heavy-traffic analysis of the maximum of an asymptotically stable random walk
| dc.creator | Shneer, Seva | |
| dc.creator | Wachtel, Vitali | |
| dc.date | 2009-02-12 | |
| dc.date.accessioned | 2026-07-07T12:41:01Z | |
| dc.date.available | 2026-07-07T12:41:01Z | |
| dc.description | For families of random walks $\{S_k^{(a)}\}$ with $\mathbf E S_k^{(a)} = -ka < 0$ we consider their maxima $M^{(a)} = \sup_{k \ge 0} S_k^{(a)}$. We investigate the asymptotic behaviour of $M^{(a)}$ as $a \to 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. | |
| dc.description | 9 pages | |
| dc.identifier | https://arxiv.org/abs/0902.2185 | |
| dc.identifier | http://arxiv.org/abs/0902.2185 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/219632 | |
| dc.subject | Probability | |
| dc.subject | 60G50, 60K25, 60F05 | |
| dc.title | Heavy-traffic analysis of the maximum of an asymptotically stable random walk | |
| dc.type | text |