Explicit bounds are given for the Kolmogorov and Wasserstein distances between a mixture of normal distributions, by which we mean that the conditional distribution given some $\sigma$ -algebra is normal, and a normal distribution with properly chosen parameter values. The bounds depend only on the first two moments of the first two conditional moments given the $\sigma$ -algebra. The proof is based on Stein’s method. As an application, we consider the Yule–Ornstein–Uhlenbeck model, used in the field of phylogenetic comparative methods. We obtain bounds for both distances between the distribution of the average value of a phenotypic trait over n related species, and a normal distribution. The bounds imply and extend earlier limit theorems by Bartoszek and Sagitov.

For all α > 0 and real random variables X, we establish sharp bounds for the smallest and the largest deviation of αX from the logarithmic distribution also known as Benford's law. In the case of uniform X, the value of the smallest possible deviation is determined explicitly. Our elementary calculation puts into perspective the recurring claims that a random variable conforms to Benford's law, at least approximately, whenever it has large spread.

The contribution of the theory of scan statistics to the study of many real-life applications has been rapidly expanding during the last decades. The multiple scan statistic, defined on a sequence of n Bernoulli trials, enumerates the number of occurrences of k consecutive trials which contain at least r successes among them (r≤k≤n). In this paper we establish some asymptotic results for the distribution of the multiple scan statistic, as n,k,r→∞ and illustrate their accuracy through a simulation study. Our approach is based on an appropriate combination of compound Poisson approximation and random walk theory.

Consider an absolutely continuous distribution on [0, ∞) with finite mean μ and hazard rate function h(t) ≤ b for all t. For bμ close to 1, we would expect F to be approximately exponential. In this paper we obtain sharp bounds for the Kolmogorov distance between F and an exponential distribution with mean μ, as well as between F and an exponential distribution with failure rate b. We apply these bounds to several examples. Applications are presented to geometric convolutions, birth and death processes, first-passage times, and to decreasing mean residual life distributions.

Let X1, X2,… and Y1, Y2,… be two sequences of absolutely continuous, independent and identically distributed (i.i.d.) random variables with equal means E(Xi)=E(Yi), i=1,2,… In this work we provide upper bounds for the total variation and Kolmogorov distances between the distributions of the partial sums ∑i=1nXi and ∑i=1nYi. In the case where the distributions of the Xis and the Yis are compared with respect to the convex order, the proposed upper bounds are further refined. Finally, in order to illustrate the applicability of the results presented, we consider specific examples concerning gamma and normal approximations.

The discrete scan statistic in a binary (0-1) sequence of n trials is defined as the maximum number of successes within any k consecutive trials (n and k, n ≥ k, being two positive integers). It has been used in many areas of science (quality control, molecular biology, psychology, etc.) to test the null hypothesis of uniformity against a clustering alternative. In this article we provide a compound Poisson approximation and subsequently use it to establish asymptotic results for the distribution of the discrete scan statistic as n, k → ∞ and the success probability of the trials is kept fixed. An extreme value theorem is also provided for the celebrated Erdős-Rényi statistic.

The Kolmogorov distance is used to transform arithmetic severities into equispaced arithmetic severities in order to reduce the number of calculations when using algorithms like Panjer's formulae for compound distributions. An upper bound is given for the Kolmogorov distance between the true compound distribution and the transformed one. Advantages of the Kolmogorov distance and disadvantages of the total variation distance are discussed. When the bounds are too big, a Berry-Esseen result can be used. Then almost every case can be handled by the techniques described in this paper. Numerical examples show the interest of the methods.