Hostname: page-component-7dd5485656-jtdwj Total loading time: 0 Render date: 2025-10-28T13:42:36.262Z Has data issue: false hasContentIssue false
  • English
  • Français

Decidability of α (pk) > 0 for some k

Published online by Cambridge University Press:  14 July 2016

Richard W. Madsen
Richard W. Madsen*
Affiliation:
University of Missouri-Columbia
Get access Rights & Permissions [Opens in a new window]

Abstract

Paz (1963), (1971) has shown that for an n × n stochastic matrix P the property that some power of P has a positive ergodic coefficient is decidable. In particular he shows that α (Pk) > 0 for some k, only if it is positive for k = ½n(n – 1). However he states that it is not known whether this bound is sharp. In this paper a sharp bound is given, namely k =½(n – 1)2 + ½ or ½(n − 1)2 + 1 depending on whether n is even or odd. The proof of this is based on some results from number theory.

Keywords

ERGODIC COEFFICIENTDECIDABILITYSTOCHASTIC MATRIXMARKOV CHAIN

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 12 , Issue 2 , June 1975 , pp. 333 - 340
Copyright
Copyright © Applied Probability Trust 1975 

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

Dobrushin, R. L. (1956) Central limit theorem for nonstationary Markov chains I, II. Theor. Probability Appl. 1, 65–80 and 329–383.CrossRefGoogle Scholar
Hajnal, J. (1958) Weak ergodicity in non-homoengeous Markov chains. Proc. Camb. Phil. Soc. 54, 233–246.CrossRefGoogle Scholar
Madsen, R. W. and Isaacson, D. L. (1973) Strongly ergodic behavior for non-stationary Markov processes. Ann. Probability 1, 329–335.Google Scholar
Madsen, R. W. (1974) A method of generating a complete system of residues with application. University of Missouri-Columbia Mathematical Sciences Technical Report No. 50.Google Scholar
Mott, J. L. (1957) Conditions for the ergodicity of non-homogeneous finite Markov chains. Proc. Roy. Soc. Edinburgh 64, 369–380.Google Scholar
Paz, A. (1963) Graph theoretical and algebraic characterisation of some Markov processes. Israel J. Math. 1, 169–180.CrossRefGoogle Scholar
Paz, A. (1970) Ergodic theorems for infinite probabilistic tables. Ann. Math. Statist. 41, 539–550.CrossRefGoogle Scholar
Paz, A. (1971) Introduction to Probabilistic Automata. Academic Press, New York.Google Scholar
Paz, A. and Reichaw, M. (1967) Ergodic theorems for sequences of infinite stochastic matrices. Proc. Camb. Phil. Soc. 63, 777–784.Google Scholar
Perkins, P. (1961) A theorem on regular matrices. Pacific J. Math. 11, 1529–1533.Google Scholar