Strong memoryless times and rare events in Markov renewal point processes.
From MaRDI portal
Publication:1889787
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 zeta, we construct a ``strong memoryless time hat zeta such that zeta-t is exponentially distributed conditional on {hat zetaleq 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 4060392 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 3796940 (Why is no real title available?)
- A New Approach to the Limit Theory of Recurrent Markov Chains
- A splitting technique for Harris recurrent Markov chains
- Approximating IMRL distributions by exponential distributions, with applications to first passage times
- Compound Poisson approximation for Markov chains using Stein's method
- Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains.
- Compound Poisson process approximation.
- Extremal theory for stochastic processes
- Infinite Particle Systems
- On stationary renewal reward processes where most rewards are zero
- On the number of lost customers in stationary loss systems in the light traffic case
- Poisson perturbations
- Probability approximations via the Poisson clumping heuristic
- Rarefactions of compound point processes
- Refined distributional approximations for the uncovered set in the Johnson-Mehl model.
- Shuffling Cards and Stopping Times
- Stationary random processes associated with point processes
- Strong stationary times via a new form of duality
- Strong uniform times and finite random walks
Cited in
(5)- scientific article; zbMATH DE number 125765 (Why is no real title available?)
- On stationary renewal reward processes where most rewards are zero
- Ergodicity and inequalities in a class of point processes
- On the occurrence of composite events and clusters of points
- Imbedded construction of stationary sequences and point processes with a random memory
This page was built for publication: Strong memoryless times and rare events in Markov renewal point processes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889787)