Hostname: page-component-586b7cd67f-t8hqh Total loading time: 0 Render date: 2024-11-22T04:36:51.309Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on the classification of Q-processes when Q is not regular

Published online by Cambridge University Press:  14 July 2016

P. K. Pollett
P. K. Pollett*
Affiliation:
University of Queensland
*
∗Postal address: Department of Mathematics, The University of Queensland, St. Lucia, QLD 4067, Australia.
Get access Rights & Permissions [Opens in a new window]

Abstract

We shall provide a classification of states for processes other than the Feller minimal process. In particular, we shall study the regularity, recurrence, transience, etc. of these processes. Our results are based on the observation that certain honest Q-processes exhibit regenerative behaviour. We shall also comment on the problem of determining stationary distributions directly from the transition rates.

Keywords

MARKOV CHAINSINVARIANT MEASURE
Type
Research Papers
Information
Journal of Applied Probability , Volume 27 , Issue 2 , June 1990 , pp. 278 - 290
Copyright
Copyright © Applied Probability Trust 1990 

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

Chung, K. L. (1967) Markov Chains with Stationary Transition Probabilities, 2nd edn. Springer-Verlag, Berlin.Google Scholar
Doob, J. L. (1945) Markov chains – denumerable case. Trans. Amer. Math. Soc. 58, 455–473.Google Scholar
Freedman, D. (1971) Markov Chains. Holden-Day, San Francisco.Google Scholar
Grimmett, G. and Stirzaker, D. (1982) Probability and Random Processes. Oxford University Press.Google Scholar
Heyman, D. P. and Sobel, M. (1982) Stochastic Models in Operations Research, Vol. 1. McGraw-Hill, New York.Google Scholar
Kelly, F. P. (1983) Invariant measures and the q-matrix. In Probability, Statistics and Analysis, ed. Kingman, J. F. C. and Reuter, G. E. H., LMS Lecture Notes Series, Cambridge University Press, 143–160.Google Scholar
Kendall, D. G. (1956) Some further pathological examples in the theory of denumerable Markov processes. Quart. J. Math. Oxford 7, 39–56.CrossRefGoogle Scholar
Kendall, D. G. and Reuter, G. E. H. (1957) The calculation of the ergodic projection for Markov chains and processes with a countable number of states. Acta Math. 97, 103–144.Google Scholar
Lamb, C. W. (1971) On the construction of certain transition functions. Ann. Math. Statist. 42, 439–450.CrossRefGoogle Scholar
Miller, D. R. (1972) Existence of limits in regenerative processes. Ann. Math. Statist. 43, 1275–1282.Google Scholar
Miller, R. G. Jr (1963) Stationary equations in continuous-time Markov chains. Trans. Amer. Math. Soc. 109, 35–44.Google Scholar
Reuter, G. E. H. (1957) Denumerable Markov processes and the associated contraction semigroups on l. Acta Math. 97, 1–46.Google Scholar
Reuter, G. E. H. (1959) Denumerable Markov processes (II). J. London Math. Soc. 34, 81–91.Google Scholar
Reuter, G. E. H. (1962) Denumerable Markov processes (III). J. London Math. Soc. 37, 63–73.CrossRefGoogle Scholar
Ross, S. (1970) Applied Probability Models with Optimization Applications. Holden-Day, San Francisco.Google Scholar
Williams, D. (1964) On the construction problem for Markov chains. Z. Wahrscheinlichkeitsth. 3, 227–246.Google Scholar