English
Related papers

Related papers: Closeness of convolutions of probability measures

200 papers

We consider the approximation of a convolution of possibly different probability measures by (compound) Poisson distributions and also by related signed measures of higher order. We present new total variation bounds having a better…

Probability · Mathematics 2017-03-08 Bero Roos

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…

Statistics Theory · Mathematics 2010-10-11 Michael V. Boutsikas , Eutichia Vaggelatou

In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…

Probability · Mathematics 2022-10-24 Arturo Jaramillo , James Melbourne

The aim of the present work is to show that the results obtained earlier on the approximation of distributions of sums of independent summands by the accompanying compound Poisson laws and the estimates of the proximity of sequential…

Probability · Mathematics 2022-08-04 Friedrich Götze , Andrei Yu. Zaitsev

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…

Probability · Mathematics 2020-06-26 A. N. Kumar , P. Vellaisamy , F. Viens

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

Computational Complexity · Computer Science 2026-05-14 Christopher Williamson

Based on the~method of subordinating functions we prove bounds for the minimal error of approximations of $n$-fold convolutions of probability measures by free infinitely divisible probability measures.

Probability · Mathematics 2020-10-14 G. P. Chistyakov , F. Götze

We obtain a formula for the density of the free convolution of an arbitrary probability measure on the unit circle of $\mathbb{C}$ with the free multiplicative analogues of the normal distribution on the unit circle. This description relies…

Probability · Mathematics 2014-04-25 Ping Zhong

We study the discrepancy between the distribution of a vector-valued functional of i.i.d. random elements and that of a Gaussian vector. Our main contribution is an explicit bound on the convex distance between the two distributions,…

Probability · Mathematics 2022-03-25 Mikołaj J. Kasprzak , Giovanni Peccati

Statistical divergences are ubiquitous in machine learning as tools for measuring discrepancy between probability distributions. As these applications inherently rely on approximating distributions from samples, we consider empirical…

Statistics Theory · Mathematics 2020-05-01 Ziv Goldfeld , Kengo Kato

We study the problem of bounding the posterior distribution of discrete probabilistic programs with unbounded support, loops, and conditioning. Loops pose the main difficulty in this setting: even if exact Bayesian inference is possible,…

Programming Languages · Computer Science 2024-12-06 Fabian Zaiser , Andrzej S. Murawski , C. -H. Luke Ong

We examine how the measure and the number of vertices of the convex hull of a random sample of $n$ points from an arbitrary probability measure in $\mathbf{R}^d$ relates to the wet part of that measure. This extends classical results for…

Probability · Mathematics 2020-10-13 Imre Bárány , Matthieu Fradelizi , Xavier Goaoc , Alfredo Hubard , Günter Rote

For arbitrary Borel probability measures with compact support on the real line, characterizations are established of the best finitely supported approximations, relative to three familiar probability metrics (Levy, Kantorovich, and…

Probability · Mathematics 2018-03-29 Arno Berger , Chuang Xu

An important tool to quantify the likeness of two probability measures are f-divergences, which have seen widespread application in statistics and information theory. An example is the total variation, which plays an exceptional role among…

Probability · Mathematics 2009-03-11 Jochen Bröcker

Quantile aggregation with dependence uncertainty has a long history in probability theory with wide applications in finance, risk management, statistics, and operations research. Using a recent result on inf-convolution of quantile-based…

Risk Management · Quantitative Finance 2024-09-09 Jose Blanchet , Henry Lam , Yang Liu , Ruodu Wang

New bounds for the $k$-th order derivatives of the solutions of the normal and multivariate normal Stein equations are obtained. Our general order bounds involve fewer derivatives of the test function than those in the existing literature.…

Probability · Mathematics 2017-03-21 Robert E. Gaunt

An often-cited fact regarding mixing or mixture distributions is that their density functions are able to approximate the density function of any unknown distribution to arbitrary degrees of accuracy, provided that the mixing or mixture…

Other Statistics · Statistics 2018-03-05 Hien D. Nguyen , Geoffrey J. McLachlan

This paper investigates the approximation of Gaussian random variables in Banach spaces, focusing on the high-probability bounds for the approximation of Gaussian random variables using finitely many observations. We derive non-asymptotic…

Statistics Theory · Mathematics 2025-08-28 Daniel Winkle , Ingo Steinwart , Bernard Haasdonk

We obtain bounds to quantify the distributional approximation in the delta method for vector statistics (the sample mean of $n$ independent random vectors) for normal and non-normal limits, measured using smooth test functions. For normal…

Statistics Theory · Mathematics 2023-05-11 Robert E. Gaunt , Heather Sutcliffe

We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…

Computational Complexity · Computer Science 2023-11-16 Anindya De , Shivam Nadimpalli , Rocco A. Servedio
‹ Prev 1 2 3 10 Next ›