Bounds on Lyapunov exponents via entropy accumulation
arXiv:1905.03270 · doi:10.1109/TIT.2020.3026959
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.
arXiv commentv4: 24 pages, published version
References in corpus (10)
- The operational meaning of min- and max-entropy
- Entropy accumulation
- Entropy accumulation with improved second-order term
- A chain rule for the quantum relative entropy
- Lyapunov exponents for products of complex Gaussian random matrices
- The Lyapunov exponent of products of random matrices close to the identity
- Products of random matrices and generalised quantum point scatterers
- On the largest Lyapunov exponent for products of Gaussian matrices
- Continuity of the Lyapunov exponents of random matrix products
- Quantitative lower bounds on the Lyapunov exponent from multivariate matrix inequalities