Almost sure convergence of products of $2\times2$ nonnegative matrices

Authors: Alain Thomas (LATP)

arXiv: 1302.4715v2 - DOI (math.PR)

Abstract: We study the almost sure convergence of the normalized columns in an infinite product of nonnegative matrices, and the almost sure rank one property of its limit points. Given a probability on the set of $2\times2$ nonnegative matrices, with finite support $\mathcal A=\{A(0),\dots,A(s-1)\}$, and assuming that at least one of the $A(k)$ is not diagonal, the normalized columns of the product matrix $P_n=A(\omega_1)\dots A(\omega_n)$ converge almost surely (for the product probability) with an exponential rate of convergence if and only if the Lyapunov exponents are almost surely distinct. If this condition is satisfied, given a nonnegative column vector $V$ the column vector $\frac{P_nV}{\Vert P_nV\Vert}$ also converges almost surely with an exponential rate of convergence. On the other hand if we assume only that at least one of the $A(k)$ do not have the form $\begin{pmatrix}a&0\\0&d\end{pmatrix}$, $ad\ne0$, nor the form $\begin{pmatrix}0&b\\d&0\end{pmatrix}$, $bc\ne0$, the limit-points of the normalized product matrix $\frac{P_n}{\Vert P_n\Vert}$ have almost surely rank 1 -although the limits of the normalized columns can be distinct- and $\frac{P_nV}{\Vert P_nV\Vert}$ converges almost surely with a rate of convergence that can be exponential or not exponential.

Submitted to arXiv on 15 Feb. 2013

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.