Takacs' asymptotic theorem and its applications: A survey
Abstract
The book of Lajos Tak\'acs Combinatorial Methods in the Theory of Stochastic Processes has been published in 1967. It discusses various problems associated with Pk,i=P1≤ n≤(i)(Nn-n)<k-i,≤no(*) where Nn=1+2...+n is a sum of mutually independent, nonnegative integer and identically distributed random variables, πj=P\k=j\, j≥0, π0>0, and (i) is the smallest n such that Nn=n-i, i≥1. (If there is no such n, then (i)=∞.) (*) is a discrete generalization of the classic ruin probability, and its value is represented as Pk,i=Qk-i/Qk, where the sequence \Qk\k≥0 satisfies the recurrence relation of convolution type: Q0≠0 and Qk=Σj=0kπjQk-j+1. Since 1967 there have been many papers related to applications of the generalized classic ruin probability. The present survey concerns only with one of the areas of application associated with asymptotic behavior of Qk as k∞. The theorem on asymptotic behavior of Qk as k∞ and further properties of that limiting sequence are given on pages 22-23 of the aforementioned book by Tak\'acs. In the present survey we discuss applications of Tak\'acs' asymptotic theorem and other related results in queueing theory, telecommunication systems and dams. Many of the results presented in this survey have appeared recently, and some of them are new. In addition, further applications of Tak\'acs' theorem are discussed.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.