Computation of growth rates of random sequences with multi-step memory
From MaRDI portal
Publication:1946821
DOI10.1007/s10955-013-0712-1zbMath1264.82041MaRDI QIDQ1946821
Publication date: 9 April 2013
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10955-013-0712-1
15A18: Eigenvalues, singular values, and eigenvectors
82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics
15B52: Random matrices (algebraic aspects)
37M25: Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Novel computation of the growth rate of generalized random Fibonacci sequences
- Products of random matrices in statistical physics
- Regular spacings of complex eigenvalues in the one-dimensional non-Hermitian Anderson model
- Spectral curves of non-Hermitian Hamiltonians
- Lyapunov exponent and density of states of a one-dimensional non-Hermitian Schrödinger equation
- Limit theorems for non-commutative operators. I
- Disordered One-Dimensional Crystals
- On the cycle expansion for the Lyapunov exponent of a product of random matrices
- Singular behaviour of certain infinite products of random 2 × 2 matrices
- Cycle expansion for the Lyapunov exponent of a product of random matrices
- Random Fibonacci sequences
- Growth and decay of random Fibonacci sequences
- Random Fibonacci sequences and the number $1.13198824\dots$