关于Oldenburger-Kolakoski序列的概率扩张
On a probabilistic extension of the Oldenburger-Kolakoski sequence
摘要:
Oldenburger-Kolakoski序列是字母表$\{1,2\}$上唯一以$1$开始的无限序列,并且是其自身的行程长度编码。在目前的工作中,我们采取了一个步骤,从这个众所周知的和研究的序列,通过引入一些随机选择的字母写。这使我们能够提供一些结果的收敛密度的$1$的序列。当字母的选择由无限i.i.d.序列给出时随机变量或马尔可夫链,字母的平均密度收敛。此外,在i.i.d.的情况下,随机变量,我们能够证明密度甚至几乎必然收敛。
英文摘要:
The Oldenburger-Kolakoski sequence is the only infinite sequence over the alphabet $\{1,2\}$ that starts with $1$ and is its own run-length encoding. In the present work, we take a step back from this largely known and studied sequence by introducing some randomness in the choice of the letters written. This enables us to provide some results on the convergence of the density of $1$'s in the resulting sequence. When the choice of the letters is given by an infinite sequence of i.i.d. random variables or by a Markov chain, the average densities of letters converge. Moreover, in the case of i.i.d. random variables, we are able to prove that the densities even almost surely converge.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。