Random walk with a heavy-tailed jump distribution
Frm the author's abstract: The classical random walk of which the one-step displacement variable \({\mathbf u}\) has a first finite negative moment is considered. It is assumed that the right-hand and/or the left-hand tail of the distribution of \({\mathbf u}\) are heavy-tailed. It is shown that the random walk can serve as a model for the actual waiting process of a GI/G/1 queueing model; in that case the distribution of \({\mathbf u}\) is that of the difference of the service time and the interarrival time. The analysis of the present study then describes the heavy-traffic theory for the case with heavy-tailed service- and/or interarrival time distribution.
- Heavy-tailed random walks on complexes of half-lines
- Khintchine-Pollaczek formula for random walks whose steps have one geometric tail
- Discrete and continuous time modulated random walks with heavy-tailed increments
- scientific article; zbMATH DE number 934477 (Why is no real title available?)
- Convergence of the all-time supremum of a Lévy process in the heavy-traffic regime
- Obituary for J. W. Cohen (1923--2000)
This page was built for publication: Random walk with a heavy-tailed jump distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961048)