Takacs' asymptotic theorem and its applications: A survey

Abstract

The book of Lajos Takács \emph{Combinatorial Methods in the Theory of Stochastic Processes} has been published in 1967. It discusses various problems associated with $$ P_{k,i}=\mathrm{P}{\sup_{1\leq n\leqρ(i)}(N_n-n)<k-i},\leqno(*) $$ where $N_n={\nu }_1+{\nu }_2...+{\nu }_n$ is a sum of mutually independent, nonnegative integer and identically distributed random variables, ${\pi }_j=\mathrm{P}\{{\nu }_k=j\}$, $j\ge 0$, ${\pi }_0>0$, and $\rho (i)$ is the smallest $n$ such that $N_n=n-i$, $i\ge 1$. (If there is no such $n$, then $\rho (i)=\infty$.) (*) is a discrete generalization of the classic ruin probability, and its value is represented as $P_{k,i}=Q_{k-i}/Q_k$, where the sequence $\{Q_k{\}}_{k\ge 0}$ satisfies the recurrence relation of convolution type: $Q_0\ne 0$ and $Q_k={\sum }_{j=0}^k{\pi }_j{Q}_{k-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 $Q_k$ as $k\to \infty$. The theorem on asymptotic behavior of $Q_k$ as $k\to \infty$ and further properties of that limiting sequence are given on pages 22-23 of the aforementioned book by Takács. In the present survey we discuss applications of Takács' 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ács' theorem are discussed.

43 pages, Review paper, accepted to Acta Appl. Math

References in corpus (5)

• Asymptotic Behavior of the Number of Lost Messages
• Asymptotic analysis of the GI/M/1/n loss system as n increases to infinity
• Optimal control of a large dam
• Asymptotic Analysis of Losses in the $GI/M/m/n$ Queueing System as $n$ Increases to Infinity
• The effective bandwidth problem revisited

Cited by in corpus (2)

• Statistical analysis of single-server loss queueing systems
• Crossings states and sets of states in Pólya random walks