2000 character limit reached
About ergodicity and polynomial convergence rate of Generalized Markov modulated Poisson processes (2010.05875v1)
Published 12 Oct 2020 in math.PR
Abstract: Generalization of the Lorden's inequality is an excellent tool for obtaining strong upper bounds for the convergence rate for various complicated stochastic models. This paper demonstrates a method for obtaining such bounds for some generalization of the Markov modulated Poisson process (MMPP). The proposed method can be applied to reliability and queuing theory.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
