Related papers: Poisson approximation and Weibull asymptotics in t…
This paper deals with U-statistics of Poisson processes and multiple Wiener-It\^o integrals on the Poisson space. Via sharp bounds on the cumulants for both classes of random variables, moderate deviation principles, concentration…
The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…
In this paper, we study the distribution of the minimal distance (in the Hamming metric) of a random linear code of dimension $k$ in $\mathbb{F}_q^n$. We provide quantitative estimates showing that the distribution function of the minimal…
This work establishes computable bounds between f-divergences for probability measures within a generalized quasi-$\varepsilon_{(M,m)}$-neighborhood framework. We make the following key contributions. (1) a unified characterization of local…
We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and…
We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…
This paper establishes expectation and variance asymptotics for statistics of the Poisson--Voronoi approximation of general sets, as the underlying intensity of the Poisson point process tends to infinity. Statistics of interest include…
We establish estimates for the asymptotic best approximation of the Euclidean unit ball by polytopes under a notion of distance induced by the intrinsic volumes. We also introduce a notion of distance between convex bodies that is induced…
Two approaches are suggested to the definition of asymmetric generalized Weibull distribution. These approaches are based on the representation of the two-sided Weibull distributions as variance-mean normal mixtures or more general…
We prove a higher-rank analogue of a well-known result of W. M. Schmidt concerning almost everywhere pointwise discrepancy bounds for lattices in Euclidean space (see Theorem 1 [Trans. Amer. Math. Soc. 95 (1960), 516-529]). We also…
We establish a general inequality on the Poisson space, yielding an upper bound for the distance in total variation between the law of a regular random variable with values in the integers and a Poisson distribution. Several applications…
The seminal result of Johnson and Lindenstrauss on random embeddings has been intensively studied in applied and theoretical computer science. Despite that vast body of literature, we still lack of complete understanding of statistical…
Benford's law states that many data sets have a bias towards lower leading digits (about $30\%$ are 1s). There are numerous applications, from designing efficient computers to detecting tax, voter and image fraud. It's important to know…
We establish existence, uniqueness and optimal regularity results for very weak solutions to certain nonlinear elliptic boundary value problems. We introduce structural asymptotic assumptions of Uhlenbeck type on the nonlinearity, which are…
We establish effective convergence rates in the Doeblin-Lenstra law, describing the limiting distribution of approximation coefficients arising from continued fraction convergents of a typical real number. More generally, we prove…
The well-known "Janson's inequality" gives Poisson-like upper bounds for the lower tail probability \Pr(X \le (1-\eps)\E X) when X is the sum of dependent indicator random variables of a special form. We show that, for large deviations,…
Minkowski's 2nd theorem in the Geometry of Numbers provides optimal upper and lower bounds for the volume of a $o$-symmetric convex body in terms of its successive minima. In this paper we study extensions of this theorem from two different…
Consider a real matrix $\Theta$ consisting of rows $(\theta_{i,1},\ldots,\theta_{i,n})$, for $1\leq i\leq m$. The problem of making the system linear forms $x_{1}\theta_{i,1}+\cdots+x_{n}\theta_{i,n}-y_{i}$ for integers $x_{j},y_{i}$ small…
Through a reformulation of the local limit theorem and law of small numbers, which is obtained by working in the spaces naturally associated to the limiting distributions, we discover a general and abstract framework for the investigation…
The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…