Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-28T03:35:48.374Z Has data issue: false hasContentIssue false
  • English
  • Français

Criteria for classifying general Markov chains

Published online by Cambridge University Press:  01 July 2016

R. L. Tweedie
R. L. Tweedie*
Affiliation:
C.S.I.R.O. Division of Mathematics and Statistics, Canberra
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
I. Invited Review and Research Papers
Information
Advances in Applied Probability , Volume 9 , Issue 2 , June 1977 , pp. 208 - 210
Copyright
Copyright © Applied Probability Trust 1977 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Foster, F. G. (1953) On the stochastic processes associated with certain queueing processes. Ann. Math. Statist. 24, 355–360.Google Scholar
[2] Laslett, G. M., Pollard, D. B. and Tweedie, R. L. (1976) Techniques for establishing ergodic and recurrence properties of continuous valued Markov chains. Submitted for publication.Google Scholar
[3] Orey, S. (1971) Lecture Notes on Limit Theorems for Markov Chains on a General State Space. Van Nostrand Reinhold, London.Google Scholar
[4] Pollard, D. B. and Tweedie, R. L. (1976) R-theory for Markov chains on a topological state space II. Z. Wahrscheinlichkeitsth. 34, 269–278.Google Scholar
[5] Revuz, D. (1975) Markov Chains. North Holland, Amsterdam.Google Scholar
[6] Tweedie, R. L. (1976) Criteria for classifying general Markov chains. Adv. Appl. Prob. 8, 737–771.CrossRefGoogle Scholar