Skip to main content

Run Statistics for Geometrically Distributed Random Variables

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1776))

Abstract

For words of length n, generated by independent geometric random variables, we consider the mean and variance, and thereafter the distribution of the number of runs of equal letters in the words. In addition, we consider the mean length of a run as well as the length of the longest run over all words of length n.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Devroye, L.: A limit theory for random skip lists. Advances in Applied Probability 2, 597–609 (1992)

    Article  MathSciNet  Google Scholar 

  2. Flajolet, P., Gourdon, X., Dumas, P.: Mellin transforms and asymptotics: Harmonic sums. Theoretical Computer Science 144, 3–58 (1995)

    Article  MathSciNet  Google Scholar 

  3. Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences 31, 182–209 (1985)

    Article  MathSciNet  Google Scholar 

  4. Guibas, L., Odlyzko, A.: Long repetitive patterns in random sequences. Zeitschrift für Wahrscheinlichkeitstheorie 53, 241–262 (1980)

    Article  MathSciNet  Google Scholar 

  5. Hwang, H.-K.: On convergence rates in the central limit theorems for combinatorial structures. European Journal of Combinatorics 19, 329–343 (1998)

    Article  MathSciNet  Google Scholar 

  6. Kirschenhofer, P., Prodinger, H.: On the analysis of probabilistic counting. In: Hlawka, E., Tichy, R.F. (eds.) Number–theoretic Analysis. Lecture Notes in Mathematics, vol. 1452, pp. 117–220 (1990)

    Google Scholar 

  7. Kirschenhofer, P., Prodinger, H.: A result in order statistics related to probabilistic counting. Computing 51, 15–27 (1993)

    Article  MathSciNet  Google Scholar 

  8. Kirschenhofer, P., Prodinger, H.: The path length of random skip lists. Acta Informatica 31, 775–792 (1994)

    Article  MathSciNet  Google Scholar 

  9. Kirschenhofer, P., Prodinger, H., Szpankowski, W.: Analysis of a splitting process arising in probabilistic counting and other related algorithms. Random Structures and Algorithms 9, 379–401 (1996)

    Article  MathSciNet  Google Scholar 

  10. Knopfmacher, A., Prodinger, H.: Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum. Discrete Mathematics (to appear)

    Google Scholar 

  11. Knuth, D.E.: The average time for carry propagation. Indagationes Mathematicae 40, 238–242 (1978)

    Article  MathSciNet  Google Scholar 

  12. Knuth, D.E.: The Art of Computer Programming, 2nd edn. Sorting and Searching, vol. 3. Addison-Wesley, Reading (1998)

    MATH  Google Scholar 

  13. Papadakis, T., Munro, I., Poblete, P.: Average search and update costs in skip lists. BIT 32, 316–332 (1992)

    Article  MathSciNet  Google Scholar 

  14. Prodinger, H.: Combinatorics of geometrically distributed random variables: Leftto-right maxima. Discrete Mathematics 153, 253–270 (1996)

    Article  MathSciNet  Google Scholar 

  15. Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Communications of the ACM 33, 668–676 (1990)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grabner, P.J., Knopfmacher, A., Prodinger, H. (2000). Run Statistics for Geometrically Distributed Random Variables. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_45

Download citation

  • DOI: https://doi.org/10.1007/10719839_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67306-4

  • Online ISBN: 978-3-540-46415-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics