Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Probability Theory and Related Fields
  3. Article
Deviations from uniformity in random strings
Download PDF
Download PDF
  • Published: December 1988

Deviations from uniformity in random strings

  • P. Flajolet1,
  • P. Kirschenhofer2 &
  • R. F. Tichy2 

Probability Theory and Related Fields volume 80, pages 139–150 (1988)Cite this article

  • 100 Accesses

  • 23 Citations

  • 1 Altmetric

  • Metrics details

Summary

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

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

References

  1. Feller, W.: An introduction to probability theory and its applications, 3rd edn. Wiley 1968

  2. Flajolet, P., Kirschenhofer, P., Tichy, R.: Discrepancy of sequences infinite strings. In: Coll. Math.; Janos Bolyai Soc., Proc. 1986 Conf. on Irregularities of partitions, to appear

  3. Goulden, I., Jackson, D.: Combinatorial enumerations. New York: Wiley 1983

    Google Scholar 

  4. Guibas, L.J., Odlyzko, A.M.: Maximal prefix-synchronized codes. SIAM J. Appl. Math. 35, 401–418 (1978)

    Google Scholar 

  5. Guibas, L.J., Odlyzko, A.M.: Periods in strings. J. Comb. Th. (A) 30, 19–42 (1981)

    Google Scholar 

  6. Guibas, L.J., Odlyzko, A.M.: Strings overlaps, pattern matching and nontransitive games. J. Comb. Theory, Ser. A 30, 183–208 (1981)

    Google Scholar 

  7. Hlawka, E.: Theorie der Gleichverteilung. Mannheim Wien Zürich: Bibliographisches Institut 1969

    Google Scholar 

  8. Knuth, D.E.: The art of computer programming, vol. 1: Fundamental algorithms, Reading Mass: Addison-Wesley 1968

    Google Scholar 

  9. Knuth, D.E.: The art of computer programming, vol. 2: Semi-numerical algorithms, Reading Mass: Addison-Wesley 1969

    Google Scholar 

  10. Kuipers, L., Niederreiter, H.: Uniform distriubution of sequences. New York: Wiley 1974

    Google Scholar 

  11. Kirschenhofer, P., Tichy, R.: Some distribution properties of 0–1 sequences, Manuscr. Math. 54, 205–219 (1985)

    Google Scholar 

  12. Odlyzko, A.M.: Enumeration of strings. In: Apostolicao, A., Galil, Z. (eds.) Combinatorial algorithms on words. NATO ASI Series F12, Berlin Heidelberg New York: Springer 1984

    Google Scholar 

  13. Révész, P.: Strong theorems in coin tossing. Proc. 1978 Int. Congress of Mathematicians, Helsinki 1980

Download references

Author information

Authors and Affiliations

  1. INRIA, Rocquencourt, F-78150, Le Chesnay, France

    P. Flajolet

  2. Technische Universität Wien, Wiedner Hauptstraße 8-10, A-1040, Vienna, Austria

    P. Kirschenhofer & R. F. Tichy

Authors
  1. P. Flajolet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Kirschenhofer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. F. Tichy
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research of the three authors was supported by the French-Austrian scientific cooperation programme

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Flajolet, P., Kirschenhofer, P. & Tichy, R.F. Deviations from uniformity in random strings. Probab. Th. Rel. Fields 80, 139–150 (1988). https://doi.org/10.1007/BF00348756

Download citation

  • Received: 24 August 1987

  • Issue Date: December 1988

  • DOI: https://doi.org/10.1007/BF00348756

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Generate Function
  • Stochastic Process
  • Probability Theory
  • Statistical Theory
  • Contour Integration
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature