Almost-sure Growth Rate of Generalized Random Fibonacci sequences

preprint2008arXivOpen access

Abstract

We study the generalized random Fibonacci sequences defined by their first nonnegative terms and for n≥1n\ge 1, Fn+2=λFn+1±FnF_{n+2} = λF_{n+1} \pm F_{n} (linear case) and F~n+2=∣λF~n+1±F~n∣\widetilde F_{n+2} = |λ\widetilde F_{n+1} \pm \widetilde F_{n}| (non-linear case), where each ±\pm sign is independent and either ++ with probability pp or −- with probability 1−p1-p (0<p≤10<p\le 1). Our main result is that, when λλ is of the form λk=2cos⁡(π/k)λ_k = 2\cos (π/k) for some integer k≥3k\ge 3, the exponential growth of FnF_n for 0<p≤10<p\le 1, and of F~n\widetilde F_{n} for 1/k<p≤11/k < p\le 1, is almost surely positive and given by ∫0∞log⁡xdνk,ρ(x), \int_0^\infty \log x dν_{k, ρ} (x), where ρρ is an explicit function of pp depending on the case we consider, taking values in [0,1][0, 1], and νk,ρν_{k, ρ} is an explicit probability distribution on $\RR_+$ defined inductively on generalized Stern-Brocot intervals. We also provide an integral formula for 0<p≤10<p\le 1 in the easier case λ≥2λ\ge 2. Finally, we study the variations of the exponent as a function of pp.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.