A random variable $\xi$ has a light-tailed distribution (for short, is light-tailed) if it possesses a finite exponential moment, ${\mathbb{E}} \, {\exp}{(\lambda \xi)} <\infty$ for some $\lambda >0$, and has a heavy-tailed distribution (is heavy-tailed) if ${\mathbb{E}} \, {\exp}{(\lambda\xi)} = \infty$ for all $\lambda>0$. Leipus et al. (2023 AIMS Math. 8, 13066–13072) presented a particular example of a light-tailed random variable that is the minimum of two independent heavy-tailed random variables. We show that this phenomenon is universal: any light-tailed random variable with right-unbounded support may be represented as the minimum of two independent heavy-tailed random variables. Moreover, a more general fact holds: these two independent random variables may have as heavy-tailed distributions as we wish. Further, we extend the latter result to the minimum of any finite number of independent random variables. We also comment on possible generalizations of our result to the case of dependent random variables.

Let (X i )i∈ℕ be a sequence of independent and identically distributed random variables with values in the set ℕ0of 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.

In this paper, we consider the asymptotic behavior of stationary probability vectors of Markov chains of GI/G/1 type. The generating function of the stationary probability vector is explicitly expressed by the R-measure. This expression of the generating function is more convenient for the asymptotic analysis than those in the literature. The RG-factorization of both the repeating row and the Wiener-Hopf equations for the boundary row are used to provide necessary spectral properties. The stationary probability vector of a Markov chain of GI/G/1 type is shown to be light tailed if the blocks of the repeating row and the blocks of the boundary row are light tailed. We derive two classes of explicit expression for the asymptotic behavior, the geometric tail, and the semigeometric tail, based on the repeating row, the boundary row, or the minimal positive solution of a crucial equation involved in the generating function, and discuss the singularity classes of the stationary probability vector.