An elementary proof that random Fibonacci sequences grow exponentially
From MaRDI portal
Abstract: We consider random Fibonacci sequences given by . Viswanath (cite{viswanath}), following Furstenberg (cite{furst}) showed that when , , but his proof involves the use of floating point computer calculations. We give a completely elementary proof that where is the expected value for the absolute value of the th term in a random Fibonacci sequence. We compute this expected value using recurrence relations which bound the sum of all possible th terms for such sequences. In addition, we give upper an lower
Recommendations
Cites work
Cited in
(17)- scientific article; zbMATH DE number 2228550 (Why is no real title available?)
- On the average growth of random Fibonacci sequences
- Return of Fibonacci random walks
- Random Fibonacci sequences
- How do random Fibonacci sequences grow?
- Growth and decay of random Fibonacci sequences
- A Fibonacci type sequence with Prouhet-Thue-Morse coefficients
- On the periodicity of certain recursive sequences
- Numerical results on some generalized random Fibonacci sequences
- Computing Lyapunov constants for random recurrences with smooth coefficients
- Random Fibonacci sequences and the number $1.13198824\dots$
- The growth rate of random balancing sequence
- Generalised Fibonacci sequences constructed from balanced words
- Growth rate for the expected value of a generalized random Fibonacci sequence
- On \((a,b)\) pairs in random Fibonacci sequences
- Random balancing-like sequences
- scientific article; zbMATH DE number 3895140 (Why is no real title available?)
This page was built for publication: An elementary proof that random Fibonacci sequences grow exponentially
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863329)