pith. sign in

arxiv: 1607.03172 · v1 · pith:Y4GCC35Rnew · submitted 2016-07-11 · 🧮 math.PR · math.CO

Asymptotic Lyapunov exponents for large random matrices

classification 🧮 math.PR math.CO
keywords matricesrandomdotsasymptoticatomsconnectionconvergenceconverges
0
0 comments X
read the original abstract

Suppose that A_1,\dots, A_N are independent random matrices whose atoms are iid copies of a random variable \xi of mean zero and variance one. It is known from the works of Newman et. al. in the late 80s that when \xi is gaussian then N^{-1} \log ||A_N \dots A_1|| converges to a non-random limit. We extend this result to more general matrices with explicit rate of convergence. Our method relies on a simple connection between structures and dynamics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.