Let (X
i
)
i∈ℕ be a sequence of independent and identically distributed random variables with values in the set ℕ0
of nonnegative integers. Motivated by applications in enumerative combinatorics and analysis of algorithms we investigate the number of gaps and the length of the longest gap in the set {X
1,…,X
n
} of the first n values. We obtain necessary and sufficient conditions in terms of the tail sequence (q
k
)
k∈ℕ0
,
q
k
=P(X
1≥ k), for the gaps to vanish asymptotically as n→∞: these are ∑
k=0
∞
q
k+1/q
k
<∞ and limk→∞
q
k+1/q
k
=0 for convergence almost surely and convergence in probability, respectively. We further show that the length of the longest gap tends to ∞ in probability if q
k+1/q
k
→ 1. For the family of geometric distributions, which can be regarded as the borderline case between the light-tailed and the heavy-tailed situations and which is also of particular interest in applications, we study the distribution of the length of the longest gap, using a construction based on the Sukhatme–Rényi representation of exponential order statistics to resolve the asymptotic distributional periodicities.
Enumerative Combinatorics of Intervals in the Dyck Pattern Poset