论文标题
随机bottring中最长持续时间的差异
Variance of Longest Run Duration in a Random Bitstring
论文作者
论文摘要
我们继续进行较早的研究，从不受限制的$ n $ bitsring开始，现在关注的是平均行为，而更多地关注不确定性。之间的相互作用 $ \ bullet $最长的0和1跑 $ \ bullet $最长的0s和bitsums（1 s），当botsring为solus时 $ \\ $正在检查。虽然负相关将零作为$ n \ rightArrow \ infty \ in the前者（对于1秒）而言，但后者的极限显然是非零的（分别为1s）。当0s和1凝结（bimultus），以及0s结块但分离1时（persolus）时，类似的分析是可能的。我们的方法基于实验。
We continue an earlier study, starting with unconstrained $n$-bitstrings, focusing now less on average behavior and more on uncertainty. The interplay between $\bullet$ longest runs of 0s and of 1s, when bitstrings are multus $\bullet$ longest runs of 0s and bitsums (# of 1s), when bitstrings are solus $\\$ is examined. While negative correlations approach zero as $n \rightarrow \infty$ in the former (for clumped 1s), the limit is evidently nonzero in the latter (for separated 1s). Similar analysis is possible when both 0s and 1s are clumped (bimultus), and when 0s are clumped but 1s are separated (persolus). Our methods are experimentally-based.
