Bounds on Lyapunov exponents via entropy accumulation

Abstract

Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an information theoretic tool called entropy accumulation theorem we derive an upper and a lower bound for the maximal and minimal Lyapunov exponent, respectively. The bounds assume independence of the random matrices, are analytical, and are tight in the commutative case as well as in other scenarios. They can be expressed in terms of an optimization problem that only involves single matrices rather than large products. The upper bound for the maximal Lyapunov exponent can be evaluated efficiently via the theory of convex optimization.

v4: 24 pages, published version

References in corpus (5)

• A chain rule for the quantum relative entropy
• The Lyapunov exponent of products of random $2\times 2$ matrices close to the identity
• Products of random matrices and generalised quantum point scatterers
• Continuity of the Lyapunov exponents of random matrix products
• Quantitative lower bounds on the Lyapunov exponent from multivariate matrix inequalities

Cited by in corpus (3)

• Data Encryption based on 9D Complex Chaotic System with Quaternion for Smart Grid
• Data Encryption based on 7D Complex Chaotic System with Cubic Memristor for Smart Grid
• Quantitative lower bounds on the Lyapunov exponent from multivariate matrix inequalities