Skip to main content

Explicit Rates of Convergence of Stochastically Ordered Markov Chains*

  • Conference paper
Athens Conference on Applied Probability and Time Series Analysis

Part of the book series: Lecture Notes in Statistics ((LNS,volume 114))

Abstract

Let \( \Phi = \left\{ {{\Phi _n}} \right\} \)be a Markov chain on a half-line [0, ∞) that is stochastically ordered in its initial state. We find conditions under which there are explicit bounds on the rate of convergence of the chain to a stationary limit π: specifically, for suitable rate functions r which may be geometric or subgeometric and “moments” f ≥ 1, we find conditions under which

$$ r\left( n \right)\mathop {\sup }\limits_{|g| \leqslant f} |{E_x}\left[ {g\left( {{\Phi _n}} \right)} \right] - \pi \left( g \right)| \leqslant M\left( x \right) $$

for all n and all x. We find bounds on r ( n ) and M(x) both in terms of geometric and subgeometric “drift functions”, and in terms of behaviour of the hitting times on {0} and on compact sets [0 c ] for c > 0. The results are illustrated for random walks and for a multiplicative time series model.

Article Footnote

Work supported in part by NSF Grants DMS-9205687 and DMS-9504561

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Peter H. Baxendale. Uniform estimates for geometric ergodicity of recurrent Markov processes. Unpublished report, University of Southern California, 1993.

    Google Scholar 

  2. P. D. Feigin and R. L. Tweedie. Random coefficient autoregressive processes: a Markov chain analysis of stationarity and finiteness of moments. J. Time Ser. Anal. 6:1–14, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  3. T. Lindvall. On coupling of discrete renewal processes. Z. Wahrscheinlichkeitstheorie and Verw. Geb. 48:57–70, 1979.

    Article  MathSciNet  MATH  Google Scholar 

  4. T. Lindvall. Lectures on the Coupling Method. John Wiley & Sons, New York, 1992.

    MATH  Google Scholar 

  5. R.B. Lund and R.L. Tweedie. Geometric convergence rates for stochastically ordered Markov chains. Maths. of O.R. (accepted for publication).

    Google Scholar 

  6. R.B. Lund, S.P. Meyn and R.L. Tweedie. Computable exponential convergence rates for stochastically ordered Markov processes. Ann. Appl. Probab. (accepted for publication).

    Google Scholar 

  7. S. P. Meyn and R. L. Tweedie. Stability of Markovian processes I: Discrete time chains. Adv. Appl. Probab. 24:542–574, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  8. S. P. Meyn and R. L. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, London, 1993.

    Book  MATH  Google Scholar 

  9. S. P. Meyn and R. L. Tweedie. Computable bounds for convergence rates of Markov chains. Ann. Appl. Probab. 4:981–1011, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  10. E. Nummelin and P. Tuominen. Geometric ergodicity of Harris recurrent Markov chains with applications to renewal theory. Stoch. Proc. Appins. 12:187–202, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  11. E. Nummelin and P. Tuominen. The rate of convergence in Orey’s theorem for Harris recurrent Markov chains with applications to renewal theory. Stoch. Proc. Appins. 15:295–311, 1983.

    Article  MathSciNet  MATH  Google Scholar 

  12. E. Nummelin and R. L. Tweedie. Geometric ergodicity and R- positivity for general Markov chains. Ann. Probab. 6:404–420, 1978.

    Article  MathSciNet  MATH  Google Scholar 

  13. J.S. Rosenthal. Minorization conditions and convergence rates for Markov chain Monte Carlo. J. Amer. Statist. Assoc. 90:558–566, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  14. D. Stoyan. Comparison Methods for Queues and Other Stochastic Models. John Wiley and Sons, London, 1983.

    MATH  Google Scholar 

  15. P. Tuominen and R.L. Tweedie. Subgeometric rates of convergence of f -ergodic Markov chains. Adv. Appl. Probab. 26:775–798, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  16. R. L. Tweedie. Criteria for rates of convergence of Markov chains with application to queueing and storage theory. In J. F. C. Kingman and G. E. H. Reuter, editors Probability Statistics and Analysis. London Mathematics Society Lecture Note Series, Cambridge University Press, Cambridge, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media New York

About this paper

Cite this paper

Scott, D.J., Tweedie, R.L. (1996). Explicit Rates of Convergence of Stochastically Ordered Markov Chains*. In: Heyde, C.C., Prohorov, Y.V., Pyke, R., Rachev, S.T. (eds) Athens Conference on Applied Probability and Time Series Analysis. Lecture Notes in Statistics, vol 114. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0749-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0749-8_12

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-94788-4

  • Online ISBN: 978-1-4612-0749-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics