Computation of growth rates of random sequences with multi-step memory
From MaRDI portal
Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Recommendations
Cites work
- scientific article; zbMATH DE number 3913325 (Why is no real title available?)
- scientific article; zbMATH DE number 3945004 (Why is no real title available?)
- scientific article; zbMATH DE number 3969805 (Why is no real title available?)
- Cycle expansion for the Lyapunov exponent of a product of random matrices
- Disordered One-Dimensional Crystals
- Growth and decay of random Fibonacci sequences
- Limit theorems for non-commutative operators. I
- Lyapunov exponent and density of states of a one-dimensional non-Hermitian Schrödinger equation
- Novel computation of the growth rate of generalized random Fibonacci sequences
- On the cycle expansion for the Lyapunov exponent of a product of random matrices
- Products of random matrices in statistical physics
- Random Fibonacci sequences
- Random Fibonacci sequences and the number $1.13198824\dots$
- Regular spacings of complex eigenvalues in the one-dimensional non-Hermitian Anderson model
- Singular behaviour of certain infinite products of random 2 × 2 matrices
- Spectral curves of non-Hermitian Hamiltonians
Cited in
(3)
This page was built for publication: Computation of growth rates of random sequences with multi-step memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1946821)