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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Devroye, L.: A limit theory for random skip lists. Advances in Applied Probability 2, 597–609 (1992)
Flajolet, P., Gourdon, X., Dumas, P.: Mellin transforms and asymptotics: Harmonic sums. Theoretical Computer Science 144, 3–58 (1995)
Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences 31, 182–209 (1985)
Guibas, L., Odlyzko, A.: Long repetitive patterns in random sequences. Zeitschrift für Wahrscheinlichkeitstheorie 53, 241–262 (1980)
Hwang, H.-K.: On convergence rates in the central limit theorems for combinatorial structures. European Journal of Combinatorics 19, 329–343 (1998)
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)
Kirschenhofer, P., Prodinger, H.: A result in order statistics related to probabilistic counting. Computing 51, 15–27 (1993)
Kirschenhofer, P., Prodinger, H.: The path length of random skip lists. Acta Informatica 31, 775–792 (1994)
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)
Knopfmacher, A., Prodinger, H.: Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum. Discrete Mathematics (to appear)
Knuth, D.E.: The average time for carry propagation. Indagationes Mathematicae 40, 238–242 (1978)
Knuth, D.E.: The Art of Computer Programming, 2nd edn. Sorting and Searching, vol. 3. Addison-Wesley, Reading (1998)
Papadakis, T., Munro, I., Poblete, P.: Average search and update costs in skip lists. BIT 32, 316–332 (1992)
Prodinger, H.: Combinatorics of geometrically distributed random variables: Leftto-right maxima. Discrete Mathematics 153, 253–270 (1996)
Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Communications of the ACM 33, 668–676 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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