Concentration Inequalities on the Multislice and for Sampling Without Replacement

We present concentration inequalities on the multislice which are based on (modified) log-Sobolev inequalities. This includes bounds for convex functions and multilinear polynomials. As an application, we show concentration results for the triangle count in the G(n, M) Erdős–Rényi model resembling known bounds in the G(n, p) case. Moreover, we give a proof of Talagrand’s convex distance inequality for the multislice. Interpreting the multislice in a sampling without replacement context, we furthermore present concentration results for n out of N sampling without replacement. Based on a bounded difference inequality involving the finite-sampling correction factor $$1 - (n / N)$$ 1 - ( n / N ) , we present an easy proof of Serfling’s inequality with a slightly worse factor in the exponent, as well as a sub-Gaussian right tail for the Kolmogorov distance between the empirical measure and the true distribution of the sample.

An Edgeworth Expansion for the Ratio of Two Functionals of Gaussian Fields and Optimal Berry–Esseen Bounds

This paper is concerned with the rate of convergence of the distribution of the sequence {Fn/Gn}, where Fn and Gn are each functionals of infinite-dimensional Gaussian fields. This form very frequently appears in the estimation problem of parameters occurring in Stochastic Differential Equations (SDEs) and Stochastic Partial Differential Equations (SPDEs). We develop a new technique to compute the exact rate of convergence on the Kolmogorov distance for the normal approximation of Fn/Gn. As a tool for our work, an Edgeworth expansion for the distribution of Fn/Gn, with an explicitly expressed remainder, will be developed, and this remainder term will be controlled to obtain an optimal bound. As an application, we provide an optimal Berry–Esseen bound of the Maximum Likelihood Estimator (MLE) of an unknown parameter appearing in SDEs and SPDEs.

Asymptotic Analysis of Finite-Source M/GI/1 Retrial Queueing Systems with Collisions and Server Subject to Breakdowns and Repairs

This paper deals with a retrial queuing system with a finite number of sources and collision of the customers, where the server is subject to random breakdowns and repairs depending on whether it is idle or busy. A significant difference of this system from the previous ones is that the service time is assumed to follow a general distribution while the server’s lifetime and repair time is supposed to be exponentially distributed. The considered system is investigated by the method of asymptotic analysis under the condition of an unlimited growing number of sources. As a result, it is proved that the limiting probability distribution of the number of customers in the system follows a Gaussian distribution with given parameters. The Gaussian approximation and the estimations obtained by stochastic simulations of the prelimit probability distribution are compared to each other and measured by the Kolmogorov distance. Several examples are treated and figures show the accuracy and area of applicability of the proposed asymptotic method.

On Approximation of the Tails of the Binomial Distribution with These of the Poisson Law

A subject of this study is the behavior of the tail of the binomial distribution in the case of the Poisson approximation. The deviation from unit of the ratio of the tail of the binomial distribution and that of the Poisson distribution, multiplied by the correction factor, is estimated. A new type of approximation is introduced when the parameter of the approximating Poisson law depends on the point at which the approximation is performed. Then the transition to the approximation by the Poisson law with the parameter equal to the mathematical expectation of the approximated binomial law is carried out. In both cases error estimates are obtained. A number of conjectures are made about the refinement of the known estimates for the Kolmogorov distance between binomial and Poisson distributions.

Rate of convergence for traditional Pólya urns

Consider a Pólya urn with balls of several colours, where balls are drawn sequentially and each drawn ball is immediately replaced together with a fixed number of balls of the same colour. It is well known that the proportions of balls of the different colours converge in distribution to a Dirichlet distribution. We show that the rate of convergence is $\Theta(1/n)$ in the minimal $L_p$ metric for any $p\in[1,\infty]$, extending a result by Goldstein and Reinert; we further show the same rate for the Lévy distance, while the rate for the Kolmogorov distance depends on the parameters, i.e. on the initial composition of the urn. The method used here differs from the one used by Goldstein and Reinert, and uses direct calculations based on the known exact distributions.

Rate of convergence to the Circular Law via smoothing inequalities for log-potentials

The aim of this paper is to investigate the Kolmogorov distance of the Circular Law to the empirical spectral distribution of non-Hermitian random matrices with independent entries. The optimal rate of convergence is determined by the Ginibre ensemble and is given by [Formula: see text]. A smoothing inequality for complex measures that quantitatively relates the uniform Kolmogorov-like distance to the concentration of logarithmic potentials is shown. Combining it with results from Local Circular Laws, we apply it to prove nearly optimal rate of convergence to the Circular Law in Kolmogorov distance. Furthermore, we show that the same rate of convergence holds for the empirical measure of the roots of Weyl random polynomials.

Efficient Optimal Approximation of Discrete Random Variables for Estimation of Probabilities of Missing Deadlines

We present an efficient algorithm that, given a discrete random variable X and a number m, computes a random variable whose support is of size at most m and whose Kolmogorov distance from X is minimal. We present some variants of the algorithm, analyse their correctness and computational complexity, and present a detailed empirical evaluation that shows how they performs in practice. The main application that we examine, which is our motivation for this work, is estimation of the probability of missing deadlines in series-parallel schedules. Since exact computation of these probabilities is NP-hard, we propose to use the algorithms described in this paper to obtain an approximation.