Related papers: Discretized normal approximation by Stein's method
We study the distribution of diameters d of Erd\"os-R\'enyi random graphs with average connectivity c. The diameter d is the maximum among all shortest distances between pairs of nodes in a graph and an important quantity for all dynamic…
This article derives quantitative limit theorems for multivariate Poisson and Poisson process approximations. Employing the solution of Stein's equation for Poisson random variables, we obtain an explicit bound for the multivariate Poisson…
We derive a Gaussian Central Limit Theorem for the sample quantiles based on locally dependent random variables with explicit convergence rate. Our approach is based on converting the problem to a sum of indicator random variables, applying…
We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…
In this paper, we consider random walk in random environment on $\mathbb{Z}^{d}\,(d\geq1)$ and prove the Strassen's strong invariance principle for this model, via martingale argument and the theory of fractional coboundaries of Derriennic…
Combining Stein's method with heat kernel techniques, we study the function Tr(AO), where A is a fixed n by n real matrix over such that Tr(AA^t)=n, and O is from the Haar measure of the orthogonal group O(n,R). It is shown that the total…
This paper considers the entropy of the sum of (possibly dependent and non-identically distributed) Bernoulli random variables. Upper bounds on the error that follows from an approximation of this entropy by the entropy of a Poisson random…
In the first part of the paper we use a new Fourier technique to obtain a Stein characterizations for random variables in the second Wiener chaos. We provide the connection between this result and similar conclusions that can be derived…
We investigate the asymptotic normality of the posterior distribution in the discrete setting, when model dimension increases with sample size. We consider a probability mass function $\theta_0$ on $\mathbbm{N}\setminus \{0\}$ and a…
We study a generalized version of Wyner's common information problem (also coined the distributed source simulation problem). The original common information problem consists in understanding the minimum rate of the common input to…
We are interested in the Euler-Maruyama discretization of a stochastic differential equation in dimension $d$ with constant diffusion coefficient and bounded measurable drift coefficient. In the scheme, a randomization of the time variable…
The Generalized Central Limit Theorem is a remarkable generalization of the Central Limit Theorem, showing that the sum of a large number of independent, identically-distributed (i.i.d) random variables with infinite variance may converge…
We present a straightforward formulation of Stein's method for the semicircular distribution, specifically designed for the analysis of non-commutative random variables. Our approach employs a non-commutative version of Stein's heuristic,…
We provide explicit bounds on the Wasserstein distance between discrete time martingales and the standard normal distribution. The proofs are based on a combination of Lindeberg's and Stein's method.
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…
One of the major themes of random matrix theory is that many asymptotic properties of traditionally studied distributions of random matrices are universal. We probe the edges of universality by studying the spectral properties of random…
We provide an abstract multivariate central limit theorem with the Lindeberg-type error bounded in terms of Lipschitz functions (Wasserstein 1-distance) or functions with bounded second or third derivatives. The result is proved by means of…
We consider the number of crossings in a random embedding of a graph, $G$, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of $G$.…
We give an upper bound on the total variation distance between the linear eigenvalue statistic, properly scaled and centred, of a random matrix with a variance profile and the standard Gaussian random variable. The second order Poincar\'e…
We establish normal approximation in the Wasserstein metric for both non-degenerate and degenerate second-order U-statistics under cross-sectional dependence using Stein's method. For the non-degenerate case, our results extend recent…