Related papers: Mod-discrete expansions
In this article, we provide an extension of the Chen-Stein inequality for Poisson approximation in the total variation distance for sums of independent Bernoulli random variables in two ways. We prove that we can improve the rate of…
In this paper, we use the framework of mod-$\phi$ convergence to prove precise large or moderate deviations for quite general sequences of real valued random variables $(X_{n})_{n \in \mathbb{N}}$, which can be lattice or non-lattice…
We study asymptotic expansions in free probability. In a class of classical limit theorems Edgeworth expansion can be obtained via a general approach using sequences of "influence" functions of individual random elements described by…
The paper applies the theory developed in Part I to the discrete normal approximation in total variation of random vectors in ${\mathbb Z}^d$. We illustrate the use of the method for sums of independent integer valued random vectors, and…
Computing the similarity between two probability distributions is a recurring theme across control. We introduce a unified family of distances between the probability distributions of two random variables that is based on the discrepancy…
We show that the distribution of self-normalized sums of free self-adjoint random variables converges weakly to Wigner's semicircle law under appropriate conditions and estimate the rate of convergence in terms of the Kolmogorov distance.…
Let $X$ be a random variable that takes its values in $\frac{1}{q}\mathbb{Z}$, for some integer $q\ge2$, and consider $X$ rounded to an integer, either downwards or upwards or to the nearest integer. We give general formulas for the…
Two old conjectures from problem sections, one of which from SIAM Review, concern the question of finding distributions that maximize P(Sn <= t), where Sn is the sum of i.i.d. random variables X1, ..., Xn on the interval [0,1], satisfying…
In this work, we study convergence in probability and almost sure convergence for weighted partial sums of random variables that are related to the class of generalized Oppenheim expansions. It is worth noting that the random variables…
We consider the classical problem of discrete distribution estimation using i.i.d. samples in a novel scenario where additional side information is available on the distribution. In large alphabet datasets such as text corpora, such side…
A classical problem in statistics is estimating the expected coverage of a sample, which has had applications in gene expression, microbial ecology, optimization, and even numismatics. Here we consider a related extension of this problem to…
Information projections are the key building block of variational inference algorithms and are used to approximate a target probabilistic model by projecting it onto a family of tractable distributions. In general, there is no guarantee on…
Given an $n$-sample of random vectors $(X_i,Y_i)_{1 \leq i \leq n}$ whose joint law is unknown, the long-standing problem of supervised classification aims to \textit{optimally} predict the label $Y$ of a given a new observation $X$. In…
We examine the normal approximation of the modified likelihood root, an inferential tool from higher-order asymptotic theory, for the linear exponential and location-scale family. We show that the $r^\star$ statistic can be thought of as a…
In random matrix theory, the spacing distribution functions $p^{(n)}(s)$ are well fitted by the Wigner surmise and its generalizations. In this approximation the spacing functions are completely described by the behavior of the exact…
An Edgeworth-type expansion is established for the entropy distance to the class of normal distributions of sums of i.i.d. random variables or vectors, satisfying minimal moment conditions.
This paper is concerned with a rate-distortion theory for sequences of i.i.d. random variables with general distribution supported on general sets including manifolds and fractal sets. Manifold structures are prevalent in data science,…
The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we…
Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…
Gradients have been exploited in proposal distributions to accelerate the convergence of Markov chain Monte Carlo algorithms on discrete distributions. However, these methods require a natural differentiable extension of the target discrete…