On Determining the Convergence Rate of an Infinite Product of Stochastic Matrices

By a convergent set is meant a set of stochastic matrices where every infinite product of matrices from every compact subset converges to a rank one matrix.

Well-known examples include the set of all scrambling matrices, the set of all stochastic matrices with all diagonal entries positive and a rooted graph, the set of all Sarymsakov matrices, and the set of doubly stochastic matrices with positive diagonal entries and a weakly connected graph.

It is known that every infinite product from each compact set of every convergent set converges to its limit exponentially fast, but not much is known about the rate of convergence when not all matrices involved are scrambling matrices.

This paper deals with bounding the rate of convergence in convergent sets using submultiplicative seminorms.

It is shown that only in some convergent sets all matrices are contractions in the same seminorm, and in particular that this method cannot be used to determine the convergence rate for the class of matrices with positive diagonal entries and a rooted graph.

As a second contribution, it is shown that for every compact convergent set and every submultiplicative seminorm, there is a finite number $k$ such that all products of $k$ matrices from the set are contractions in the seminorm.

Finally, several open questions are posed for future research.