An elementary proof that random Fibonacci sequences grow exponentially
From MaRDI portal
Publication:863329
DOI10.1016/J.JNT.2006.01.002zbMATH Open1171.11044arXivmath/0510159OpenAlexW2075512443WikidataQ56019341 ScholiaQ56019341MaRDI QIDQ863329FDOQ863329
Authors: Eran Makover, Jeffrey McGowan
Publication date: 26 January 2007
Published in: Journal of Number Theory (Search for Journal in Brave)
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
Full work available at URL: https://arxiv.org/abs/math/0510159
Recommendations
Combinatorial probability (60C05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Special sequences (11K31)
Cites Work
Cited In (17)
- On the average growth of random Fibonacci sequences
- How do random Fibonacci sequences grow?
- Numerical results on some generalized random Fibonacci sequences
- A Fibonacci type sequence with Prouhet-Thue-Morse coefficients
- Generalised Fibonacci sequences constructed from balanced words
- On \((a,b)\) pairs in random Fibonacci sequences
- On the periodicity of certain recursive sequences
- Random Fibonacci sequences
- Return of Fibonacci random walks
- The growth rate of random balancing sequence
- Growth rate for the expected value of a generalized random Fibonacci sequence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random balancing-like sequences
- Computing Lyapunov constants for random recurrences with smooth coefficients
- Growth and decay of random Fibonacci sequences
- Random Fibonacci sequences and the number $1.13198824\dots$
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)