Easy estimates of Lyapunov exponents for random products of matrices
Abstract
The problems that we consider in this paper are as follows. Let A1, …, Ak be square matrices (over reals). Let W=w(A1, …, Ak) be a random product of n matrices. What is the expected absolute value of the largest (in the absolute value) entry in such a random product? What is the (maximal) Lyapunov exponent for a random matrix product like that? We give an answer to the first question under some mild restrictions on the entries of Ai. For the second question, we offer a very simple and efficient method to produce an upper bound on the Lyapunov exponent.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.