Everything about Random Fibonacci sequence
Randomized mathematical sequence based upon the Fibonacci sequence
In mathematics, the random Fibonacci sequence is a stochastic analogue of the Fibonacci sequence defined by the recurrence relation, where the signs + or − are chosen at random with equal probability, independently for different. By a theorem of Harry Kesten and Hillel Furstenberg, random recurrent sequences of this kind grow at a certain exponential rate, but it is difficult to compute the rate explicitly. In 1999, Divakar Viswanath showed that the growth rate of the random Fibonacci sequence is equal to 1.1319882487943..., a mathematical constant that was later named Viswanath's constant. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Random Fibonacci sequenceA 5-minute orientation
- Skim a recent paper: Distribution Generated by a Random Inhomogenous Fibonacci SequenceInfluential work since 2022
- Pick up a classic book: The Da Vinci CodeThe most-reprinted book on the subject
- Read the landmark paper: Random Fibonacci sequencesCited 23 times
- Go sideways: Generalizations of Fibonacci numbersA closely related topic
- Go sideways: Fibonacci sequenceA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Random Fibonacci sequences
Generating pseudo-random numbers by shuffling a Fibonacci sequence
Stochastic filtering of a random Fibonacci sequence: Theory and applications
Growth rate for the expected value of a generalized random Fibonacci sequence
Fibonacci sequence for modelling stop bands in random microstructure
Random Fibonacci-Type Sequences
Random Fixed Point on Ishikawa Random Iteration Under Fibonacci Sequence
Generating Pseudo-Random Numbers by Shuffling a Fibonacci Sequence
🆕 Influential since 2022
📚 Books worth reading
The Da Vinci CodeDan Brown · 2003
C How to ProgramPaul J. Deitel, Harvey M. Deitel · 2007
Introduction to Computing Using PythonLjubomir Perkovic · 2011
Parallel Programming in C with MPI and OpenMPMichael J. Quinn · 2003
Discrete mathematics for computer scienceGary Haggard · 2006
Data structures using C++D. S. Malik · 2010
Maths in 100 key breakthroughsRichard Elwes · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Generalizations of Fibonacci numbers In mathematics, the Fibonacci numbers form a sequence defined recursively by: Fn={0n=01n=1Fn−1+Fn−2n>1 That is, after two starting values, each number…
- Fibonacci sequence In mathematics, the Fibonacci sequence is a sequence in which each element is the sum of the two elements that precede it. Numbers that are part of the…
- Mathematical constant A mathematical constant is a number whose value is fixed by an unambiguous definition, often referred to by a special symbol (e.g., an alphabet letter)…
- Lucas number The Lucas sequence is an integer sequence named after the mathematician François Édouard Anatole Lucas (1842–1891), who studied both that sequence and…
- Tightness of measures In mathematics, tightness is a concept in measure theory. The intuitive idea is that a given collection of measures does not "escape to infinity". Let…
- Golden ratio In mathematics, two quantities are in the golden ratio if their ratio is the same as the ratio of their sum to the larger of the two quantities. Expressed…
- Truncated normal distribution In probability and statistics, the truncated normal distribution is the probability distribution derived from that of a normally distributed random variable…
- Convergence of random variables In probability theory, there exist several different notions of convergence of sequences of random variables, including convergence in probability, convergence…