Runs of geometrically distributed random variables: a probabilistic analysis

Authors:
Guy Louchard
Affiliations:
Département d'Informatique, Faculté des Sciences, Université Libre de Bruxelles, CP 212, Boulevard du Triomphe, B-1050 Brussels, Belgium
Venue:
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Year:
2002

Citing 11
Cited 2

Approximate counting: a detailed analysis

BIT - Ellis Horwood series in artificial intelligence
The path length of random skip lists

Acta Informatica
Mellin transforms and asymptotics: harmonic sums

Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
Probabilistic analysis of some (un)directed animals

Theoretical Computer Science - Special issue: selected papers from “GASCOM '94” and the “Polyominoes and Tilings” workshops
Analysis of a splitting process arising in probabilistic counting and other related algorithms

Random Structures & Algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Probabilistic analysis of column-convex and directed diagonally-convex animals: II. trajectories and shapes

Random Structures & Algorithms
Distinctness of compositions of an integer: a probabilistic analysis

Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday
Combinatorics of Geometrically Distributed Random Variables: Lenght of Ascending Runs

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Run Statistics for Geometrically Distributed Random Variables (Extended Abstract)

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm

IEEE Transactions on Information Theory

Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis

Theoretical Computer Science
Monotone runs of uniformly distributed integer random variables: a probabilistic analysis

Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using a Markov chain approach and a polyomino-like description, we study some asymptotic properties of runs of geometrically distributed random variables. We analyze the limiting trajectories, the number of runs and the run length distribution, the hitting time to a length k run and the maximum run length.