Periodic coefficients and random Fibonacci sequences (Q396963): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
Summary: The random Fibonacci sequence is defined by \(t_1 = t_2 = 1\) and \(t_n = \pm t_{n-1} + t_{n-2}\), for \(n \geq 3\), where each \(\pm\) sign is chosen at random with probability \(P(+) = P(-) = \frac{1}{2}\). Viswanath has shown that almost all random Fibonacci sequences grow exponentially at the rate \(1.13198824\ldots\). We will consider what happens to random Fibonacci sequences when we remove the randomness; specifically, we will choose coefficients which belong to the set \(\{1, -1\}\) and form periodic cycles. By rewriting our recurrences using matrix products, we will analyze sequence growth and develop criteria based on eigenvalue, trace and order for determining whether a given sequence is bounded, grows linearly or grows exponentially. Further, we will introduce an equivalence relation on the coefficient cycles such that each equivalence class has a common growth rate, and consider the number of such classes for a given cycle length. | |||
Property / review text: Summary: The random Fibonacci sequence is defined by \(t_1 = t_2 = 1\) and \(t_n = \pm t_{n-1} + t_{n-2}\), for \(n \geq 3\), where each \(\pm\) sign is chosen at random with probability \(P(+) = P(-) = \frac{1}{2}\). Viswanath has shown that almost all random Fibonacci sequences grow exponentially at the rate \(1.13198824\ldots\). We will consider what happens to random Fibonacci sequences when we remove the randomness; specifically, we will choose coefficients which belong to the set \(\{1, -1\}\) and form periodic cycles. By rewriting our recurrences using matrix products, we will analyze sequence growth and develop criteria based on eigenvalue, trace and order for determining whether a given sequence is bounded, grows linearly or grows exponentially. Further, we will introduce an equivalence relation on the coefficient cycles such that each equivalence class has a common growth rate, and consider the number of such classes for a given cycle length. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11B39 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15B36 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6330363 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random Fibonacci sequence | |||
Property / zbMATH Keywords: random Fibonacci sequence / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
growth rate | |||
Property / zbMATH Keywords: growth rate / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
periodic | |||
Property / zbMATH Keywords: periodic / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
matrix trace | |||
Property / zbMATH Keywords: matrix trace / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the cycle expansion for the Lyapunov exponent of a product of random matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An infinite transfer matrix approach to the product of random 2 × 2 positive matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The resistance of randomly grown trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Growth and decay of random Fibonacci sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Noncommuting Random Products / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4320535 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: How do random Fibonacci sequences grow? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Almost-sure growth rate of generalized random Fibonacci sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite Groups of Matrices Whose Entries Are Integers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5852771 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3068995 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4692934 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4132714 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Random Fibonacci sequences and the number $1.13198824\dots$ / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The on-line encyclopedia of integer sequences / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:17, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Periodic coefficients and random Fibonacci sequences |
scientific article |
Statements
Periodic coefficients and random Fibonacci sequences (English)
0 references
14 August 2014
0 references
Summary: The random Fibonacci sequence is defined by \(t_1 = t_2 = 1\) and \(t_n = \pm t_{n-1} + t_{n-2}\), for \(n \geq 3\), where each \(\pm\) sign is chosen at random with probability \(P(+) = P(-) = \frac{1}{2}\). Viswanath has shown that almost all random Fibonacci sequences grow exponentially at the rate \(1.13198824\ldots\). We will consider what happens to random Fibonacci sequences when we remove the randomness; specifically, we will choose coefficients which belong to the set \(\{1, -1\}\) and form periodic cycles. By rewriting our recurrences using matrix products, we will analyze sequence growth and develop criteria based on eigenvalue, trace and order for determining whether a given sequence is bounded, grows linearly or grows exponentially. Further, we will introduce an equivalence relation on the coefficient cycles such that each equivalence class has a common growth rate, and consider the number of such classes for a given cycle length.
0 references
random Fibonacci sequence
0 references
growth rate
0 references
periodic
0 references
matrix trace
0 references