Skip to main content
Log in

Perturbations of countable Markov chains and processes

  • Published:
Annals of the Institute of Statistical Mathematics Aims and scope Submit manuscript

Abstract

IfP is a transition matrix of a Markov chain, and\(\tilde P\) is derived by perturbing the elements ofP, then we find conditions such that\(\tilde P\) is also positive recurrent whenP is, and relate the invariant probability measures for the two. Similar results are found for recurrence of chains, and the methods then yield analogues for continuous time processes also.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chung, K. L. (1967).Markov Chains with Stationary Transition Probabilities, (2nd Ed.), Springer-Verlag, Berlin.

    MATH  Google Scholar 

  2. Çinlar, E. (1975).Introduction to Stochastic Processes, Prentice-Hall, New Jersey.

    MATH  Google Scholar 

  3. Jensen, A. and Kendall, D. G. (1971). Denumerable Markov processes with bounded generators: a routine for calculatingpij(∞),J. Appl. Prob.,8, 423–427.

    Article  Google Scholar 

  4. Schweitzer, P. J. (1968). Perturbation theory and finite Markov chains,J. Appl. Prob.,5, 401–413.

    Article  MathSciNet  Google Scholar 

  5. Seneta, E. (1967). Finite approximations to non-negative matrices,Proc. Camb. Phil. Soc.,63, 983–992.

    Article  MathSciNet  Google Scholar 

  6. Seneta, E. (1968). Finite approximations to non-negative matrices II: refinements and applications,Proc. Camb. Phil. Soc.,64, 465–470.

    Article  MathSciNet  Google Scholar 

  7. Takahashi, Y. (1973). On the effects of small deviations in the transition matrix of a finite Markov chain,J. Operat. Res. Soc. Japan,16, 104–129.

    MathSciNet  MATH  Google Scholar 

  8. Tweedie, R. L. (1973). The calculation of limit probabilities for denumerable Markov processes from infinitesimal properties,J. Appl. Prob.,10, 84–99.

    Article  MathSciNet  Google Scholar 

  9. Tweedie, R. L. (1975). The robustness of positive recurrence and recurrence of Markov chains under perturbations of the transition probabilities.J. Appl. Prob.,12, 744–752.

    Article  MathSciNet  Google Scholar 

  10. Tweedie, R. L. (1976). Criteria for classifying general Markov chains,Adv. Appl. Prob.,8, 737–771.

    Article  MathSciNet  Google Scholar 

Download references

Authors

Additional information

CSIRO

About this article

Cite this article

Tweedie, R.L. Perturbations of countable Markov chains and processes. Ann Inst Stat Math 32, 283–290 (1980). https://doi.org/10.1007/BF02480333

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02480333

Keywords

Navigation