Related papers: A precise local limit theorem for the multinomial …
We study the limiting distribution of a volatility target index as the discretisation time step converges to zero. Two limit theorems (a strong law of large numbers and a central limit theorem) are established, and as an application, the…
In this paper, under mild assumptions, we derive a law of large numbers, a central limit theorem with an error estimate, an almost sure invariance principle and a variant of Chernoff bound in finite-state hidden Markov models. These limit…
Two-sample inference for the difference of population means typically relies upon a Central Limit Theorem approximation. When data are drawn from a Negative Binomial distribution, previous work of Shilane et al. (2010) showed that a Normal…
In this paper, we give error bounds for the distance distribution of Reed-Muller codes, extending prior work on the distance distribution of Reed-Solomon codes. This is equivalent to the problem of counting multivariate polynomials over a…
We obtain explicit error bounds for the $d$-dimensional normal approximation on hyperrectangles for a random vector that has a Stein kernel, or admits an exchangeable pair coupling, or is a non-linear statistic of independent random…
In this article, we obtain, for the total variance distance, the error bounds between Poisson and convolution of power series distributions via Stein's method. This provides a unified approach to many known discrete distributions. Several…
We revisit the proof of the de Moivre--Laplace theorem, which is the ancestor of the central limit theorem for the binomial distribution. Our goal is to provide a proof that can be reasonably presented to undergraduate students within a…
We consider a two-color P\'{o}lya urn in the case when a fixed number $S$ of balls is added at each step. Assume it is a large urn that is, the second eigenvalue $m$ of the replacement matrix satisfies $1/2<m/S\leq1$. After $n$ drawings,…
A new bound for the remainder term in the Taylor expansion of the complex exponent $e^{ix}$, $x\in\R$, is proved yielding precise moment-type estimates of the accuracy of the approximation of the characteristic function (the…
We give abstract versions of the large deviation theorem for the distribution of zeros of polynomials and apply them to the characteristic polynomials of Hermitian random matrices. We obtain new estimates related to the local semi-circular…
Let $X_1,X_2,...,X_n$ be a sequence of independent or locally dependent random variables taking values in $\mathbb{Z}_+$. In this paper, we derive sharp bounds, via a new probabilistic method, for the total variation distance between the…
A Lagrange multiplier theorem is derived for the case of an imprecise objective function and a precise constraint. The proof uses methods of analysis which deal in a direct, algebraic way with imprecisions. They include imprecise…
The unpredictability of chaotic nonlinear dynamics leads naturally to statistical descriptions, including probabilistic limit laws such as the central limit theorem and large deviation principle. A key tool in the Nagaev-Guivarc'h spectral…
In this paper we present a new correlation inequality and use it for proving an Almost Sure Local Limit Theorem for the so-called Dickman distribution. Several related results are also proved
Consider generalized adapted stochastic integrals with respect to independently scattered random measures with second moments. We use a decoupling technique, known as the "principle of conditioning", to study their stable convergence…
We establish two theorems for assessing the accuracy in total variation of multivariate discrete normal approximation to the distribution of an integer valued random vector $W$. The first is for sums of random vectors whose dependence…
We show that the Bernoulli part extraction method can be used to obtain approximate forms of the local limit theorem for sums of independent lattice valued random variables, with effective error term, that is with explicit parameters and…
We prove a central limit theorem applicable to one dimensional stochastic approximation algorithms that converge to a point where the error terms of the algorithm do not vanish. We show how this applies to a certain class of these…
Stein's method is used to obtain two theorems on multivariate normal approximation. Our main theorem, Theorem 1.2, provides a bound on the distance to normality for any nonnegative random vector. Theorem 1.2 requires multivariate size bias…
In this paper, we study the asymptotic error distribution for a two-level irregular discretization scheme of the solution to the stochastic differential equations (SDE for short) driven by a continuous semimartingale and obtain a central…