Hostname: page-component-7dd5485656-6kn8j Total loading time: 0 Render date: 2025-10-31T22:14:48.995Z Has data issue: false hasContentIssue false
  • English
  • Français

97.49 On Markov chains

Published online by Cambridge University Press:  23 January 2015

K. C. Chan ,
C. T. Lenard  and
T. M. Mills
K. C. Chan
Affiliation:
Department of Computer Science and Computer Engineering, La Trobe University, PO Box 199, Bendigo, Victoria, 3552, Australia
C. T. Lenard
Affiliation:
Department of Mathematics and Statistics, La Trobe University, PO Box 199, Bendigo, Victoria, 3552, Australia
T. M. Mills
Affiliation:
Loddon Mallee Integrated Cancer Service, PO Box 126, Bendigo, Victoria, 3552, Australia
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.'

Information

Type
Notes
Information
The Mathematical Gazette , Volume 97 , Issue 540 , November 2013 , pp. 515 - 520
Copyright
Copyright © The Mathematical Association 2013

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.)

Article purchase

Temporarily unavailable

References

1. Feller, W., An introduction to probability theory and its applications, (3rd edn.), New York: Wiley (1968).Google Scholar
2. Chan, K. C., Lenard, C. T. and Mills, T. M., An introduction to Markov chains. In Cheeseman, J. (ed), It's my maths: personalised mathematics learning. Proceedings of the 49th Annual Conference of Mathematical Association of Victoria, 6-7 Dec 2012. Mathematical Association of Victoria (2012) pp. 40–47.Google Scholar
3. Woess, W., Denumerable Markov chains: Generating functions, boundary theory, random walks on trees. European Mathematical Society (2009).Google Scholar
4. Feller, W., Non-Markovian processes with the semigroup property. Ann. Math. Statist. 30 (1959) pp. 1252–1253.Google Scholar
5. Lévy, P., Exemples de processus pseudo-markoviens. C. R. A cad. Sci. Paris, 228 (1949) pp. 2004–2006.Google Scholar
6. Rosenblatt, M., Random processes. Springer-Verlag (1974).Google Scholar
7. Rosenblatt, M. and Slepian, D., Nth order Markov chains with every N variables independent. J. Soc. Indust. Appl. Math. 10(3) (1962) pp.537–549.Google Scholar
8. Stoyanov, J. M., Counterexamples in probability, (2nd edn.), John Wiley & Sons (1997).Google Scholar
9. Beichelt, F., Stochastic processes in science, engineering and finance. Chapman & Hall/CRC (2006).Google Scholar
10. Freedman, D., Markov chains. Springer-Verlag (1983).Google Scholar