Takács' asymptotic theorem and its applications: a survey
From MaRDI portal
(Redirected from Publication:966495)
Abstract: The book of Lajos Tak'acs 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_{1leq nleq
ho(i)}(N_n-n)<k-i},leqno(*) where is a sum of mutually independent, nonnegative integer and identically distributed random variables, , , , and is the smallest such that , . (If there is no such , then .) (*) is a discrete generalization of the classic ruin probability, and its value is represented as , where the sequence satisfies the recurrence relation of convolution type: and . 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 as . The theorem on asymptotic behavior of as 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.
Recommendations
- The work of Lajos Takács on probability theory
- scientific article; zbMATH DE number 1040052
- Tail asymptotics for Pollaczek-Khinchin type series with applications to ruin in perturbed model
- scientific article; zbMATH DE number 4069933
- An extension to the renewal theorem and an application to risk theory
Cites work
- scientific article; zbMATH DE number 2088575 (Why is no real title available?)
- scientific article; zbMATH DE number 3174015 (Why is no real title available?)
- scientific article; zbMATH DE number 4048826 (Why is no real title available?)
- scientific article; zbMATH DE number 3674647 (Why is no real title available?)
- scientific article; zbMATH DE number 3720143 (Why is no real title available?)
- scientific article; zbMATH DE number 47258 (Why is no real title available?)
- scientific article; zbMATH DE number 635602 (Why is no real title available?)
- scientific article; zbMATH DE number 1058050 (Why is no real title available?)
- scientific article; zbMATH DE number 1514781 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- scientific article; zbMATH DE number 3293452 (Why is no real title available?)
- scientific article; zbMATH DE number 3297775 (Why is no real title available?)
- scientific article; zbMATH DE number 3326826 (Why is no real title available?)
- scientific article; zbMATH DE number 3369601 (Why is no real title available?)
- scientific article; zbMATH DE number 3049368 (Why is no real title available?)
- scientific article; zbMATH DE number 3108056 (Why is no real title available?)
- PλM-policy for a dam with input formed by a compound Poisson process
- A batch-ballot problem and applications
- A comparison of the stationary distributions of GI/M/c/n and GI/M/c
- A link between wave governed random motions and ruin processes
- A note on losses in M/GI/1/n queues
- A note on the equilibrium M/G/1 queue length
- A single-server queue with limited virtual waiting time
- Analysis of packet loss processes in high-speed networks
- Asymptotic Behavior of the Number of Lost Messages
- Asymptotic analysis of the \(GI/M/1/n\) loss system as \(n\) increases to infinity
- Asymptotic behavior of loss probability in GI/M/1/\(K\) queue as \(K\) tends to infinity
- Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach
- Average cost under the PMλ, τ policy in a finite dam with compound Poisson inputs
- Ballots, queues and random graphs
- Bertrand's work on probability
- Buffer overflow period in a MAP queue
- Characterizing losses during busy periods in finite buffer systems
- Combinatorial and analytic methods in the theory of queues
- Complementary generating functions for theMX/GI/1/kandGI/My/1/Kqueues and their application to the comparison of loss probabilities
- Consecutive customer losses in oscillating \(GI^X/M//n\) systems with state dependent services rates
- Consecutive customer losses in regular and oscillating \(M^{X}/ G /1/ n\) systems
- Exact convergence rate for the distributions of \(GI\)/\(M\)/\(c\)/\(K\) queue as \(K\) tends to infinity
- First-crossing and ballot-type results for some nonstationary sequences
- Heavy-traffic limits for loss proportions in single-server queues
- Losses per cycle in a single-server queue
- ON THE NUMBER OF REFUSALS IN A BUSY PERIOD
- On a property of a refusals stream
- On dams of finite capacity
- On finite-time ruin probabilities for classical risk models
- On loss probabilities in presence of redundant packets and several traffic sources
- On losses inMX/GI/1/nqueues
- On the Busy Periods of Single-Server Queues with Poisson Input and General Service Times
- On the Classical Ruin Problems
- On the busy periods for the M/G/1 queue with finite and with infinite waiting room
- On the distribution of the maximum of sums of mutually independent and identically distributed random variables
- On the length and number of served customers of the busy period of a generalised M/G/1 queue with finite waiting room
- On the relationship between the distribution of maximal queue length in the M/G/1 queue and the mean busy period in the M/G/1/n queue
- On the remaining service time upon reaching a given level in \(M/G/1\) queues
- Optimal Control of a Large Dam
- Optimal control of a dam using Pλ,τM policies and penalty cost when the input process is a compound Poisson process with positive drift
- Optimal control of a finite dam using PMλΤ policies and penalty cost: total discounted and long run average cases
- Optimal control of a finite dam: Wiener process input
- Optimal control of finite dams: discrete (2-stage) output procedure
- Optimal stopping on trajectories and the ballot problem
- Queueing and fluid analysis of partial message discarding policy
- Sample path large deviations for queues with many inputs
- Sharp results on convergence rates for the distribution of \(\text{GI}/ \text{M}/1/K\) queues as \(K\) tends to infinity
- Some comments on a theorem of Hardy and Littlewood
- The Effective Bandwidth Problem Revisited
- The ballot theorem strikes again: Packet loss process distribution
- The output of a switch, or, effective bandwidths for networks
- The remaining service time upon reaching a high level in \(M/G/1\) queues
- Two-stage output procedure of a finite dam
- \(q\)-generalization of a ballot problem
Cited in
(4)
This page was built for publication: Takács' asymptotic theorem and its applications: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966495)