About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Statistics and Probability Letters
Paper
Conditions for weak ergodicity of inhomogeneous Markov chains
Abstract
A classical result of Wolfowitz states that an inhomogeneous Markov chain is weakly ergodic if the transition matrices are drawn from a finite set of indecomposable and aperiodic matrices and the products of transition matrices are also indecomposable and aperiodic. Since products of indecomposable and aperiodic matrices can be decomposable, any finite set of indecomposable and aperiodic transition matrices does not guarantee weak ergodicity. We present conditions for weak ergodicity which are simpler to verify and are related to properties of the graph of the transition matrices. © 2008 Elsevier B.V. All rights reserved.