The Annals of Probability

Strong memoryless times and rare events in Markov renewal point processes

Torkel Erhardsson
Source: Ann. Probab. Volume 32, Number 3B (2004), 2446-2462.

Abstract

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” $\hat{\zeta}$ such that ζ−t is exponentially distributed conditional on $\{\hat{\zeta}\leq t,\,\zeta>t\}$, 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.

First Page: Show Hide
Primary Subjects: 60K15
Secondary Subjects: 60E15
Full-text: Open access
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.aop/1091813619
Digital Object Identifier: doi:10.1214/009117904000000054
Mathematical Reviews number (MathSciNet): MR2078546
Zentralblatt MATH identifier: 02121702

References

Aldous, D. (1989). Probability Approximations via the Poisson Clumping Heuristic. Springer, New York.
Mathematical Reviews (MathSciNet): MR969362
Zentralblatt MATH: 0679.60013
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
Digital Object Identifier: doi:10.1016/0196-8858(87)90006-6
Zentralblatt MATH: 0631.60065
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.
Mathematical Reviews (MathSciNet): MR1920275
Digital Object Identifier: doi:10.1214/aop/1029867135
Project Euclid: euclid.aop/1029867135
Zentralblatt MATH: 1033.60059
Barbour, A. D. and Xia, A. (1999). Poisson perturbations. ESAIM Probab. Statist. 3 131--150.
Mathematical Reviews (MathSciNet): MR1716120
Digital Object Identifier: doi:10.1051/ps:1999106
Billingsley, P. (1986). Probability and Measure, 2nd ed. Wiley, New York.
Mathematical Reviews (MathSciNet): MR830424
Zentralblatt MATH: 0649.60001
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.
Mathematical Reviews (MathSciNet): MR1071805
Erhardsson, T. (1999). Compound Poisson approximation for Markov chains using Stein's method. Ann. Probab. 27 565--596.
Mathematical Reviews (MathSciNet): MR1681149
Digital Object Identifier: doi:10.1214/aop/1022677272
Project Euclid: euclid.aop/1022677272
Zentralblatt MATH: 0942.60007
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.
Mathematical Reviews (MathSciNet): MR1768222
Digital Object Identifier: doi:10.1214/aoap/1019487356
Project Euclid: euclid.aoap/1019487356
Zentralblatt MATH: 1063.60007
Erhardsson, T. (2000b). On stationary renewal reward processes where most rewards are zero. Probab. Theory Related Fields 117 145--161.
Mathematical Reviews (MathSciNet): MR1771658
Digital Object Identifier: doi:10.1007/s004400050001
Zentralblatt MATH: 0961.60084
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.
Mathematical Reviews (MathSciNet): MR1839237
Digital Object Identifier: doi:10.1023/A:1010868028010
Zentralblatt MATH: 1017.90019
Erhardsson, T. (2001b). Refined distributional approximations for the uncovered set in the Johnson--Mehl model. Stochastic Process. Appl. 96 243--259.
Mathematical Reviews (MathSciNet): MR1865357
Digital Object Identifier: doi:10.1016/S0304-4149(01)00114-4
Zentralblatt MATH: 1060.60008
Franken, P., König, D., Arndt, U. and Schmidt, V. (1982). Queues and Point Processes. Wiley, Chichester.
Mathematical Reviews (MathSciNet): MR691670
Zentralblatt MATH: 0505.60058
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
Zentralblatt MATH: 0467.60002
Rudin, W. (1976). Principles of Mathematical Analysis, 3rd ed. McGraw-Hill, Singapore.
Mathematical Reviews (MathSciNet): MR385023
Zentralblatt MATH: 0346.26002
Serfozo, R. F. (1984). Rarefactions of compound point processes. J. Appl. Probab. 21 710--719.
Mathematical Reviews (MathSciNet): MR766809

2012 © Institute of Mathematical Statistics

The Annals of Probability

The Annals of Probability