相关论文: How do random Fibonacci sequences grow?

We study the generalized random Fibonacci sequences defined by their first nonnegative terms and for $n\ge 1$, $F_{n+2} = \lambda F_{n+1} \pm F_{n}$ (linear case) and $\widetilde F_{n+2} = |\lambda \widetilde F_{n+1} \pm \widetilde F_{n}|$…

A random Fibonacci sequence is defined by the relation g_n = | g_{n-1} +/- g_{n-2} |, where the +/- sign is chosen by tossing a balanced coin for each n. We generalize these sequences to the case when the coin is unbalanced (denoting by p…

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…

We consider the recursion $X_{n+1}=\sum_{i=0}^n \epsilon_{n,i}X_{n-i}$, where $\epsilon_{n,i}$ are i.i.d. (Bernoulli) random variables taking values in $\{-1,1\}$, and $X_0=1$, $X_{-j}=0$ for $j>0$. We prove that almost surely, $n^{-1}\log…

We consider random Fibonacci sequences given by $x_{n+1}=\pm \beta x_{n}+x_{n-1}$. Viswanath (\cite{viswanath}), following Furstenberg (\cite{furst}) showed that when $\beta = 1$, $\lim_{n\to \infty}|x_{n}|^{1/n}=1.13...$, but his proof…

We motivate the study of a certain class of random Fibonacci sequences - which we call continuous random Fibonacci sequences - by demonstrating that their exponential growth rate can be used to establish capacity and power scaling laws for…

We study how weak disorder affects the growth of the Fibonacci series. We introduce a family of stochastic sequences that grow by the normal Fibonacci recursion with probability 1-epsilon, but follow a different recursion rule with a small…

We consider three matrix models of order 2 with one random entry $\epsilon$ and the other three entries being deterministic. In the first model, we let $\epsilon\sim\textrm{Bernoulli}\left(\frac{1}{2}\right)$. For this model we develop a…

We investigate the probability of observing a given pattern of $n$ rises and falls in a random stationary data series. The data are modelled as a sequence of $n+1$ independent and identically distributed random numbers. This probabilistic…

For every nonnegative integer $n$, let $r_F(n)$ be the number of ways to write $n$ as a sum of Fibonacci numbers, where the order of the summands does not matter. Moreover, for all positive integers $p$ and $N$, let \begin{equation*}…

The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…

The random Fibonacci chain is a generalisation of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 01$ with probability $p$ and $1 \mapsto 10$ with probability $1-p$ for $0<p<1$ and where…

A random matrix with rows distributed as a function of their length is said to be isotropic. When these distributions are Gaussian, beta type I, or beta type II, previous work has, from the viewpoint of integral geometry, obtained the…

In this paper, we propose a class of growth models, named Fibonacci trees $F(t)$, with respect to the intrinsic advantage of Fibonacci sequence $\{F_{t}\}$. First, we turn out model $F(t)$ to have power-law degree distribution with exponent…

This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…

The focus of this paper is the random sequences in the form $\{X_{0},X_{1},$ $X_{n}=X_{n-2}+X_{n-1},n=2,3,..\dot{\}},$ referred to as Fibonacci Random Sequence (FRS). The initial random variables $X_{0}$ and $X_{1}$ are assumed to be…

We consider the linear stochastic recursion $x_{i+1} = a_{i}x_{i}+b_{i}$ where the multipliers $a_i$ are random and have Markovian dependence given by the exponential of a standard Brownian motion and $b_{i}$ are i.i.d. positive random…

We study the Lyapunov exponent for electron and phonon excitations, in pure and random Fibonacci quasicrystal chains, using an exact real space renormalization group method, which allows the calculation of the Lyapunov exponent as a…

Let $\{f_n\}$ be the Fibonacci sequence. For any positive integer $n$, let $r(n)$ be the number of solutions of $n=p+f_{k_1^{2}} +f_{k_{2}^{2}}$, where $p$ is a prime and $k_1, k_2$ are nonnegative integers with $k_1\le k_2$. In this paper,…

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…