On rate of convergence for infinite server Erlang-Sevastyanov's problem
Probability
2015-12-08 v2
Abstract
Polynomial convergence rates in total variation are established in Erlang-Sevastyanov's type problem with an infinite number of servers and a general distribution of service under assumptions on the intensity of serving.
Keywords
Cite
@article{arxiv.1310.5973,
title = {On rate of convergence for infinite server Erlang-Sevastyanov's problem},
author = {Alexander Yu. Veretennikov},
journal= {arXiv preprint arXiv:1310.5973},
year = {2015}
}
Comments
24 pages; several typos corrected