Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-24T05:24:42.591Z Has data issue: false hasContentIssue false
  • English
  • Français

On Markov chains associated to random systems with complete connection

Published online by Cambridge University Press:  01 July 2016

Thomas Kaijser
Thomas Kaijser*
Affiliation:
Linköping University
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
II. Contributed Papers
Information
Advances in Applied Probability , Volume 10 , Issue 2 , June 1978 , pp. 295 - 296
Copyright
Copyright © Applied Probability Trust 1978 

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

Kaijser, T. (1972) Some limit theorems for Markov chains with applications to learning models and products of random matrices. Report, Institut Mittag-Leffler, Djursholm, Sweden.Google Scholar
Karlin, S. (1953) Some random walks arising in learning models. Pacific J. Math. 3, 725–756.Google Scholar
Norman, F. (1972) Markov Processes and Learning. Academic Press, New York.Google Scholar