相关论文: Exponential growth of random infinite Fibonacci se…

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 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 study two kinds of random Fibonacci sequences defined by $F_1=F_2=1$ and for $n\ge 1$, $F_{n+2} = F_{n+1} \pm F_{n}$ (linear case) or $F_{n+2} = |F_{n+1} \pm F_{n}|$ (non-linear case), where each sign is independent and either + with…

We consider certain Fibonacci-like sequences $(X_n)_{n\geq 0}$ perturbed with a random noise. Our main result is that $\frac{1}{X_n}\sum_{k=0}^{n-1}X_k$ converges in distribution, as $n$ goes to infinity, to a random variable $W$ with…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

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…

Suppose that A_1,\dots, A_N are independent random matrices whose atoms are iid copies of a random variable \xi of mean zero and variance one. It is known from the works of Newman et. al. in the late 80s that when \xi is gaussian then…

Let $\{u_n\}_n$ be a non-degenerate linear recurrence sequence of integers with Binet's formula given by $u_n= \sum_{i=1}^{m} P_i(n)\alpha_i^n.$ Assume $\max_i \vert \alpha_i \vert >1$. In 1977, Loxton and Van der Poorten conjectured that…

Suppose that $X_1,\...,X_n,\...$ are i.i.d. rotationally invariant $N$-by-$N$ matrices. Let $\Pi_n=X_n\... X_1$. It is known that $n^{-1}\log |\Pi_n|$ converges to a nonrandom limit. We prove that under certain additional assumptions on…

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…

We consider two ensembles of nxn matrices. The first is the set of all nxn matrices with entries zeroes and ones such that all column sums and all row sums equal r, uniformly weighted. The second is the set of nxn matrices with zero and one…

Let $ V_{n} = X_{1,n} + X_{2,n} + \cdots + X_{n,n}$ where $X_{i,n}$ are Bernoulli random variables which take the value $1$ with probability $b(i;n)$. Let $\lambda_{n} = \sum\limits_{i=1}^{n} b(i;n) $, $\lambda = \lim\limits_{n \to \infty}…

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}|$…

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 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 stochastic recursion $X_n=\Psi_n(X_{n-1})$, where $(\Psi_n)_{n\geq 1}$ is a sequence of i.i.d. random Lipschitz mappings close to the random affine transformation $x\mapsto Ax+B$. We describe the tail behaviour of the…

The classical Poisson theorem says that if $\xi_1,\xi_2,...$ are i.i.d. 0--1 Bernoulli random variables taking on 1 with probability $p_n\equiv \la/n$ then the sum $S_n=\sum_{i=1}^n\xi_i$ is asymptotically in $n$ Poisson distributed with…

Let $\{X_i,i=1,2,...\}$ be i.i.d. standard gaussian variables. Let $S_n=X_1+...+X_n$ be the sequence of partial sums and $$ L_n=\max_{0\leq i<j\leq n}\frac{S_j-S_i}{\sqrt{j-i}}. $$ We show that the distribution of $L_n$, appropriately…

In this paper, for the generalized Fibonacci sequence $\left\{W_n\left(a,b,p,q\right)\right\}$, by using elementary methods and techniques, we give the asymptotic estimation values of…