English
Related papers

Related papers: On the error bound in the normal approximation for…

200 papers

We present a new perspective of assessing the rates of convergence to the Gaussian and Poisson distributions in the Erd\"os-Kac theorem for additive arithmetic functions $\psi$ of a random integer $J_n$ uniformly distributed over…

Probability · Mathematics 2021-02-11 Louis H. Y. Chen , Arturo Jaramillo , Xiaochuan Yang

Consider the family of power divergence statistics based on $n$ trials, each leading to one of $r$ possible outcomes. This includes the log-likelihood ratio and Pearson's statistic as important special cases. It is known that in certain…

Probability · Mathematics 2024-11-08 Fraser Daly

In this paper we extend Stein's method to the distribution of the product of $n$ independent mean zero normal random variables. A Stein equation is obtained for this class of distributions, which reduces to the classical normal Stein…

Probability · Mathematics 2017-05-30 Robert E. Gaunt

This paper develops Kolmogorov-type maximal inequalities for sums of Negative Binomial random variables under both independence and dependence structures. For independent heterogeneous Negative Binomial variables we derive sharp Markov-type…

Statistics Theory · Mathematics 2026-03-23 Aristides V. Doumas , S. Spektor

We develop a new formulation of Stein's method to obtain computable upper bounds on the total variation distance between the geometric distribution and a distribution of interest. Our framework reduces the problem to the construction of a…

Probability · Mathematics 2013-03-21 Erol A. Peköz , Adrian Röllin , Nathan Ross

We refine the classical Lindeberg-Feller central limit theorem by obtaining asymptotic bounds on the Kolmogorov distance, the Wasserstein distance, and the parametrized Prokhorov distances in terms of a Lindeberg index. We thus obtain more…

Probability · Mathematics 2016-12-26 Ben Berckmoes , Geert Molenberghs

In this paper, we use Stein's method to obtain optimal bounds, both in Kolmogorov and in Wasserstein distance, in the normal approximation for the empirical distribution of the ground state of a many-interacting-worlds harmonic oscillator…

Probability · Mathematics 2022-03-30 Louis H. Y. Chen , Lê Vǎn Thành

This paper deals with the quantitative normal approximation of non-linear functionals of Poisson random measures, where the quality is measured by the Kolmogorov distance. Combining Stein's method with the Malliavin calculus of variations…

Probability · Mathematics 2014-10-30 Peter Eichelsbacher , Christoph Thaele

We establish a general Berry-Esseen type bound which gives optimal bounds in many situations under suitable moment assumptions. By combining the general bound with Palm theory, we deduce a new error bound for assessing the accuracy of…

Probability · Mathematics 2020-09-01 Louis H. Y. Chen , Adrian Röllin , Aihua Xia

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$.…

Probability · Mathematics 2024-10-14 Santiago Arenas-Velilla , Octavio Arizmendi , J. E. Paguyo

This paper provides a quantitative version of de Finetti law of large numbers. Given an infinite sequence $\{X_n\}_{n \geq 1}$ of exchangeable Bernoulli variables, it is well-known that $\frac{1}{n} \sum_{i = 1}^n X_i…

Probability · Mathematics 2020-09-22 Emanuele Dolera , Stefano Favaro

The one parameter family of Jack(alpha) measures on partitions is an important discrete analog of Dyson's beta ensembles of random matrix theory. Except for special values of alpha=1/2,1,2 which have group theoretic interpretations, the…

Combinatorics · Mathematics 2007-05-23 Jason Fulman

In this paper, we obtain uniform bounds for a number of expressions that involve derivatives and integrals of modified Bessel functions. These uniform bounds are motivated by the need to bound such expressions in the study of variance-gamma…

Classical Analysis and ODEs · Mathematics 2017-03-21 Robert E. Gaunt

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…

Combinatorics · Mathematics 2023-06-22 Harry Crane , Stephen DeSalvo

In this paper, we develop a simple non-parametric test for testing normal distribution based on the distance between empirical zero-bias transformation and empirical distribution. The asymptotic properties of the test statistic are studied.…

Statistics Theory · Mathematics 2023-11-14 Sudheesh Kattumannil

We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…

Probability · Mathematics 2007-05-23 Mathew D. Penrose , J. E. Yukich

We propose a new functional analytic approach to Stein's method of exchangeable pairs that does not require the pair at hand to satisfy any approximate linear regression property. We make use of this theory in order to derive abstract…

Probability · Mathematics 2020-08-13 Christian Döbler

In this paper we use a Malliavin-Stein type method to investigate Poisson and normal approximations for the measurable functions of infinitely many independent random variables. We combine Stein's method with the difference operators in…

Probability · Mathematics 2018-08-13 Nguyen Tien Dung

This paper establishes a non-uniform Berry--Esseen bound for non-normal approximation using Stein's method. The main theorem generalizes the result of the authors in [Comptes Rendus Mathematique, 2024] to the context of non-normal…

Probability · Mathematics 2025-06-23 Lê Vǎn Thành , Nguyen Ngoc Tu

We prove several new results on the Hamming weight of bounded uniform and small-bias distributions. We exhibit bounded-uniform distributions whose weight is anti-concentrated, matching existing concentration inequalities. This construction…

Computational Complexity · Computer Science 2024-07-18 Harm Derksen , Peter Ivanov , Chin Ho Lee , Emanuele Viola