Probability Theory and Related Fields

, Volume 80, Issue 1, pp 139–150

Deviations from uniformity in random strings

  • P. Flajolet
  • P. Kirschenhofer
  • R. F. Tichy
Article

DOI: 10.1007/BF00348756

Cite this article as:
Flajolet, P., Kirschenhofer, P. & Tichy, R.F. Probab. Th. Rel. Fields (1988) 80: 139. doi:10.1007/BF00348756

Summary

We show that almost all binary strings of length n contain all blocks of size (1-ε)log2n 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.

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • P. Flajolet
    • 1
  • P. Kirschenhofer
    • 2
  • R. F. Tichy
    • 2
  1. 1.INRIALe ChesnayFrance
  2. 2.Technische Universität WienViennaAustria