Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-10T14:13:50.596Z Has data issue: false hasContentIssue false
  • English
  • Français

Subgeometric rates of convergence for a class of continuous-time Markov process

Part of: Markov processes Special processes

Published online by Cambridge University Press:  14 July 2016

Zhenting Hou ,
Yuanyuan Liu  and
Hanjun Zhang
Zhenting Hou*
Affiliation:
Central South University
Yuanyuan Liu*
Affiliation:
Central South University
Hanjun Zhang*
Affiliation:
University of Queensland
*
∗Postal address: School of Mathematics, Central South University, Changsha, Hunan, 410075, P. R. China.
∗Postal address: School of Mathematics, Central South University, Changsha, Hunan, 410075, P. R. China.
∗∗∗∗Postal address: Department of Mathematics, The University of Queensland, Queensland, 4072, Australia. Email address: hjz@maths.uq.edu.au
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let (Φt)t∈ℝ+ be a Harris ergodic continuous-time Markov process on a general state space, with invariant probability measure π. We investigate the rates of convergence of the transition function Pt(x, ·) to π; specifically, we find conditions under which r(t)||Pt(x, ·) − π|| → 0 as t → ∞, for suitable subgeometric rate functions r(t), where ||·|| denotes the usual total variation norm for a signed measure. We derive sufficient conditions for the convergence to hold, in terms of the existence of suitable points on which the first hitting time moments are bounded. In particular, for stochastically ordered Markov processes, explicit bounds on subgeometric rates of convergence are obtained. These results are illustrated in several examples.

Keywords

Continuous-time Markov processqueueing modelbirth-death processergodicitysubgeometric convergence

MSC classification

Primary: 60J25: Continuous-time Markov processes on general state spaces
Secondary: 60K25: Queueing theory
Type
Research Papers
Information
Journal of Applied Probability , Volume 42 , Issue 3 , September 2005 , pp. 698 - 712
Copyright
© Applied Probability Trust 2005 

References

Chen, M. F. (1992). From Markov Chains to Nonequilibrium Particle Systems. World Scientific, River Edge, NJ.CrossRefGoogle Scholar
Doshi, B. (1985). An M/G/1 queue with variable vacations. In Proc. Internat. Conf. Model. Techniques Tools Performance Anal., North-Holland, Amsterdam, pp. 67–81.Google Scholar
Down, D., Meyn, S. P. and Tweedie, R. L. (1995). Exponential and uniform ergodicity of Markov processes. Ann. Prob. 23, 1671–1691.CrossRefGoogle Scholar
Foss, S. and Sapozhnikov, A. (2004). On the existence of moments for the busy period in a single-server queue. Math. Operat. Res. 29, 592–601.CrossRefGoogle Scholar
Fuhrman, S. (1984). A note on the M/G/1 queue with server vacations. Operat. Res. 32, 1368–1373.Google Scholar
Gut, A. (1974). On the moments of some first passage times for sums of dependent random variables. Stoch. Process. Appl. 2, 115–126.Google Scholar
Harris, C. and Marchal, W. (1988). State dependence in M/G/1 server vacation models. Operat. Res. 36, 560–565.Google Scholar
Hou, Z. and Liu, Y. (2004). Explicit criteria for several types of ergodicity of the embedded M/G/1 and GI/M/n queues. J. Appl. Prob. 41, 778–790.Google Scholar
Levy, H. and Kleinrock, L. (1986). A queue with starter and a queue with vacations: delay analysis by decompostition. Operat. Res. 34, 426–436.CrossRefGoogle Scholar
Levy, Y. and Yechiali, U. (1975). Utilization of idle time in an M/G/1 queueing system. Manag. Sci. 22, 202–211.Google Scholar
Lund, R. B., Meyn, S. P. and Tweedie, R. L. (1996). Computable exponential convergence rates for stochastically ordered Markov processes. Ann. Appl. Prob. 6, 218–237.Google Scholar
Mao, Y. H. (2004). Ergodic degrees for continuous-time Markov chains. Sci. China A 47, 161–174.Google Scholar
Meyn, S. P. and Tweedie, R. L. (1993). Stability of Markovian processes. II. Continuous-time processes and sampled chains. Adv. Appl. Prob. 25, 487–517.Google Scholar
Meyn, S. P. and Tweedie, R. L. (1993). Stability of Markovian processes. III. Foster–Lyapunov criteria for continuous-time processes. Adv. Appl. Prob. 25, 518–548.Google Scholar
Nummelin, E. and Tuominen, P. (1983). The rate of convergence in Orey's theorem for Harris recurrent Markov chains with applications to renewal theory. Stoch. Process. Appl. 15, 295–311.CrossRefGoogle Scholar
Thorisson, H. (1985). The queue GI/G/1: finite moments of the cycle variables and uniform rates of convergence. Stoch. Process. Appl. 19, 85–99.Google Scholar
Tuominen, P. and Tweedie, R. L. (1979). Exponential ergodicity in Markovian queueing and dam models. J. Appl. Prob. 16, 867–880.Google Scholar
Tuominen, P. and Tweedie, R. L. (1994). Subgeometric rates of convergence of f-ergodic Markov chains. Adv. Appl. Prob. 26, 775–798.Google Scholar
Van Doorn, E. A. (1981). Stochastic Monotonicity and Queueing Applications of Birth–Death Processes (Lecture Notes Statist. 4). Springer, New York.Google Scholar