We consider the random sum Sn >+ X>1 + X>2 + ...+ Xn >with a stopping rule N>= min{n> : Sn > t}>where T>is a predetermined threshold. We assume that X>1 ,X>2 ,...>are independent and identically distributed random variables having positive integer values. N>is also a positive integer‐valued random variable but dependent on the sequence X>1 , X>2 ,...>due to the stopping rule. Given T>and the probability distribution of X,>we first derive the probability distributions of N, Sn,>and of N>conditional on Sn.>Then we compute the first two moments of these three taking an instructive approach based on the absorbing Markov chain.
[1]
Kyung C. Chae,et al.
Operating characteristics of MX/G/1 queue with N-policy
,
1994,
Queueing Syst. Theory Appl..
[2]
John G. Kemeny,et al.
Finite Markov chains
,
1960
.
[3]
T. Cacoullos,et al.
On Bivariate Discrete Distributions Generated by Compounding
,
1981
.
[4]
Kyung-Chul Chae,et al.
On the geometric sum of iid random variables
,
1996
.
[5]
Ganapati P. Patil,et al.
Statistical Distributions in Scientific Work
,
1981
.
[6]
Sheldon M. Ross.
Introduction to Probability Models.
,
1995
.