Source: Ann. Probab. Volume 32, Number 3B
(2004), 2446-2462.
Let W be the number of points in (0,t] of a stationary finite-state Markov renewal point process. We derive a bound for the total variation distance between the distribution of W and a compound Poisson distribution. For any nonnegative random variable ζ, we construct a “strong memoryless time”
such that ζ−t is exponentially distributed conditional on
, for each t. This is used to embed the Markov renewal point process into another such process whose state space contains a frequently observed state which represents loss of memory in the original process. We then write W as the accumulated reward of an embedded renewal reward process, and use a compound Poisson approximation error bound for this quantity by Erhardsson. For a renewal process, the bound depends in a simple way on the first two moments of the interrenewal time distribution, and on two constants obtained from the Radon–Nikodym derivative of the interrenewal time distribution with respect to an exponential distribution. For a Poisson process, the bound is 0.
References
Aldous, D. (1989). Probability Approximations via the Poisson Clumping Heuristic. Springer, New York.
Mathematical Reviews (MathSciNet):
MR969362
Aldous, D. and Diaconis, P. (1986). Shuffling cards and stopping times. Amer. Math. Monthly 93 333--348.
Mathematical Reviews (MathSciNet):
MR841111
Aldous, D. and Diaconis, P. (1987). Strong uniform times and finite random walks. Adv. in Appl. Math. 8 69--97.
Mathematical Reviews (MathSciNet):
MR876954
Athreya, K. B. and Ney, P. (1978). A new approach to the limit theory of recurrent Markov chains. Trans. Amer. Math. Soc. 245 493--501.
Mathematical Reviews (MathSciNet):
MR511425
Barbour, A. D. and Må nsson, M. (2002). Compound Poisson process approximation. Ann. Probab. 30 1492--1537.
Barbour, A. D. and Xia, A. (1999). Poisson perturbations. ESAIM Probab. Statist. 3 131--150.
Billingsley, P. (1986). Probability and Measure, 2nd ed. Wiley, New York.
Mathematical Reviews (MathSciNet):
MR830424
Brown, M. (1983). Approximating IMRL distributions by exponential distributions, with applications to first passage times. Ann. Probab. 11 419--427.
Mathematical Reviews (MathSciNet):
MR690139
Diaconis, P. and Fill, J. A. (1990). Strong stationary times via a new form of duality. Ann. Probab. 18 1483--1522.
Erhardsson, T. (1999). Compound Poisson approximation for Markov chains using Stein's method. Ann. Probab. 27 565--596.
Erhardsson, T. (2000a). Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth--death chains. Ann. Appl. Probab. 10 573--591.
Erhardsson, T. (2000b). On stationary renewal reward processes where most rewards are zero. Probab. Theory Related Fields 117 145--161.
Erhardsson, T. (2001a). On the number of lost customers in stationary loss systems in the light traffic case. Queueing Systems Theory Appl. 38 25--47.
Erhardsson, T. (2001b). Refined distributional approximations for the uncovered set in the Johnson--Mehl model. Stochastic Process. Appl. 96 243--259.
Franken, P., König, D., Arndt, U. and Schmidt, V. (1982). Queues and Point Processes. Wiley, Chichester.
Mathematical Reviews (MathSciNet):
MR691670
Leadbetter, M. R. and Rootzén, H. (1988). Extremal theory for stochastic processes. Ann. Probab. 16 431--478.
Mathematical Reviews (MathSciNet):
MR929071
Nummelin, E. (1978). A splitting technique for Harris recurrent chains. Z. Wahrsch. Verw. Gebiete 43 309--318.
Mathematical Reviews (MathSciNet):
MR501353
Port, S. C. and Stone, C. J. (1973). Infinite particle systems. Trans. Amer. Math. Soc. 178 307--340.
Mathematical Reviews (MathSciNet):
MR326868
Rolski, T. (1981). Stationary Random Processes Associated with Point Processes. Lecture Notes in Statist. 5. Springer, New York.
Mathematical Reviews (MathSciNet):
MR616085
Rudin, W. (1976). Principles of Mathematical Analysis, 3rd ed. McGraw-Hill, Singapore.
Mathematical Reviews (MathSciNet):
MR385023
Serfozo, R. F. (1984). Rarefactions of compound point processes. J. Appl. Probab. 21 710--719.
Mathematical Reviews (MathSciNet):
MR766809