Deviations from uniformity in random strings
We show that almost all binary strings of length n contain all blocks of size \((1-\epsilon)\log _ 2 n\) a close to uniform number of times. From this, we derive tight bounds on the discrepancy of random infinite strings. Our results are obtained through explicit generating function expressions and contour integration estimates.
scientific article; zbMATH DE number 4041284
scientific article