Gaps in discrete random samples: extended abstract

Motivated by applications in enumerative combinatorics and the analysis of algorithms we investigate the number of gaps and the length of the longest gap in a discrete random sample from a general distribution. We obtain necessary and sufficient conditions on the underlying distribution for the gaps to vanish asymptotically (with probability 1, or in probability), and we study the limiting distributional behavior of these random variables in the geometric case.