Countable State Markov Shifts
- 750 Downloads
This chapter is concerned with countable state Markov shifts. The first problem is to extend the Perron-Frobenius theory to nonnegative, countably infinite matrices. There are several difficulties. Countable matrices are classified by recurrence properties. There are three classes: positive recurrent, null recurrent and transient. The corresponding version of the Perron-Frobenius Theorem is successively weakened for each class. The necessary matrix theory is treated in the first section. The treatment is complete and there are a number of examples.
KeywordsFinite Type Topological Entropy Nonnegative Matrix Maximal Measure Borel Probability Measure
Unable to display preview. Download preview PDF.
- [AKM]R. Adler, A. Konheim and M.H. MacAndrew, Topological Entropy, Transactions of the American Mathematical Society no. 114 (1965).Google Scholar
- [Fe]W. Feller, An Introduction to Probability Theory and Its Applications, 3rd. edition, Wiley, 1968.Google Scholar
- [Rd]H.L. Royden, Real Analysis, MacMillan, 1968.Google Scholar
- [Sl1]I. Salama, Topological entropy and the Classification of Countable Chains, Ph.D Thesis, University of North Carolina, Chapel Hill, 1984.Google Scholar
- [Se]E. Seneta, Non-negative Matrices and Markov Chains, Springer-Verlag, 1981.Google Scholar