Tails of waiting times and their bounds

Tails of waiting times and their bounds

0.00 Avg rating0 Votes
Article ID: iaor20003199
Country: Netherlands
Volume: 32
Issue: 1/3
Start Page Number: 257
End Page Number: 283
Publication Date: Jan 1999
Journal: Queueing Systems
Authors: ,
Keywords: statistics: distributions, stochastic processes
Abstract:

Tails of distributions having the form of the geometric convolution are considered. In the case of light-tailed summands, a simple proof of the famous Cramér asymptotic formula is given via the change of probability measure. Some related results are obtained, namely, bounds of the tails of geometric convolutions, expressions for the distribution of the 1st failure time and failure rate in regenerative systems, and others. In the case of heavy-tailed summands, two-sided bounds of the tail of the geometric convolution are given in the cases where the summands have either Pareto or Weibull distributions. The results obtained have the property that the corresponding lower and upper bounds are tailed-equivalent.

Reviews

Required fields are marked *. Your email address will not be published.