On the Entropy of Random Fibonacci Words
Abstract
The random Fibonacci chain is a generalisation of the classical Fibonacci substitution and is defined as the rule mapping 0 1 and 1 01 with probability p and 1 10 with probability 1-p for 0<p<1 and where the random rule is applied each time it acts on a 1. We show that the topological entropy of this object is given by the growth rate of the set of inflated random Fibonacci words.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.