Random Fibonacci Sequences

Abstract

Solutions to the random Fibonacci recurrence x_{n+1}=x_{n} + or - Bx_{n-1} decrease (increase) exponentially, x_{n} = exp(lambda n), for sufficiently small (large) B. In the limits B --> 0 and B --> infinity, we expand the Lyapunov exponent lambda(B) in powers of B and B^{-1}, respectively. For the classical case of $\beta =1$ we obtain exact non-perturbative results. In particular, an invariant measure associated with Ricatti variable r_n=x_{n+1}/x_{n} is shown to exhibit plateaux around all rational.

11 Pages (Multi-Column); 3 EPS Figures ; Submitted to J. Phys. A

References in corpus (1)

• Even-visiting random walks: exact and asymptotic results in one dimension

Cited by in corpus (9)

• Adsorption of Reactive Particles on a Random Catalytic Chain: An Exact Solution
• Single-Species Reactions on a Random Catalytic Chain
• Growth and Structure of Stochastic Sequences
• How do random Fibonacci sequences grow?
• Random Geometric Series
• Growth rate for the expected value of a generalized random Fibonacci sequence
• Almost-sure Growth Rate of Generalized Random Fibonacci sequences
• Weak Disorder in Fibonacci Sequences
• The Resistance Of Randomly Grown Trees