Strong memoryless times and rare events in Markov renewal point processes.

DOI10.1214/009117904000000054zbMATH Open1058.60070arXivmath/0410166OpenAlexW3105479743MaRDI QIDQ1889787FDOQ1889787

Authors: Torkel Erhardsson 

Publication date: 10 December 2004

Published in: The Annals of Probability (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0410166

Recommendations

• scientific article; zbMATH DE number 4030642
• Rare events for stationary processes.
• Renewal characterization of Markov modulated Poisson processes
• On stationary renewal reward processes where most rewards are zero
• Poisson approximation for some point processes in reliability

zbMATH Keywords

compound Poisson distributionMarkov renewal processrare eventstrong memoryless time

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Markov renewal processes, semi-Markov processes (60K15)

Cites Work

• Title not available (Why is that?)
• Probability approximations via the Poisson clumping heuristic
• Extremal theory for stochastic processes
• Shuffling Cards and Stopping Times
• Title not available (Why is that?)
• Strong uniform times and finite random walks
• Strong stationary times via a new form of duality
• A splitting technique for Harris recurrent Markov chains
• Compound Poisson approximation for Markov chains using Stein's method
• Poisson perturbations
• Infinite Particle Systems
• Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains.
• A New Approach to the Limit Theory of Recurrent Markov Chains
• Title not available (Why is that?)
• Compound Poisson process approximation.
• Stationary random processes associated with point processes
• On the number of lost customers in stationary loss systems in the light traffic case
• Rarefactions of compound point processes
• Approximating IMRL distributions by exponential distributions, with applications to first passage times
• Refined distributional approximations for the uncovered set in the Johnson-Mehl model.
• On stationary renewal reward processes where most rewards are zero

Cited In (5)

• Ergodicity and inequalities in a class of point processes
• Title not available (Why is that?)
• Imbedded construction of stationary sequences and point processes with a random memory
• On stationary renewal reward processes where most rewards are zero
• On the occurrence of composite events and clusters of points

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)