English
Related papers

Related papers: A simplified second-order Gaussian Poincar\'e ineq…

200 papers

We derive the isoperimetric profile of Gaussian type for an absolutely continuous probability measure on Euclidean spaces with respect to the Lebesgue measure, whose density is a radial function.The key is a generalization of the Poincar\'e…

Probability · Mathematics 2013-01-01 Asuka Takatsu

The classical Berry-Esseen error bound, for the normal approximation to the law of a sum of independent and identically distributed random variables, is here improved by replacing the standardised third absolute moment by a weak norm…

Probability · Mathematics 2023-11-14 Lutz Mattner

This paper provides a discrete Poincar\'e inequality in $n$ space dimensions on a simplex $K$ with explicit constants. This inequality bounds the norm of the piecewise derivative of functions with integral mean zero on $K$ and all integrals…

Numerical Analysis · Mathematics 2017-09-05 Carsten Carstensen , Friederike Hellwig

We derive Berry-Esseen approximation bounds for general functionals of independent random variables, based on chaos expansions methods. Our results apply to $U$-statistics satisfying the weak assumption of decomposability in the Hoeffding…

Probability · Mathematics 2020-10-12 Nicolas Privault , Grzegorz Serafin

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

By the continuous mapping theorem, if a sequence of $d$-dimensional random vectors $(\mathbf{W}_n)_{n\geq1}$ converges in distribution to a multivariate normal random variable $\Sigma^{1/2}\mathbf{Z}$, then the sequence of random variables…

Probability · Mathematics 2020-03-18 Robert E. Gaunt

In this paper, we propose two approaches to derive the discrete Poincar\'e inequality for the B-schemes, a family of finite volume discretization schemes, for the one-dimensional Fokker-Planck equation in full space. We study the properties…

Numerical Analysis · Mathematics 2025-07-08 Lei Li , Jian-Guo Liu , Zhen Wang

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…

Probability · Mathematics 2016-01-14 Benjamin Arras , Ehsan Azmoodeh , Guillaume Poly , Yvik Swan

Stein's method is a method of probability approximation which hinges on the solution of a functional equation. For normal approximation the functional equation is a first order differential equation. Malliavin calculus is an…

Probability · Mathematics 2015-05-11 Louis H. Y. Chen

We combine Stein's method with Malliavin calculus in order to obtain explicit bounds in the multidimensional normal approximation (in the Wasserstein distance) of functionals of Gaussian fields. Our results generalize and refine the main…

Probability · Mathematics 2008-11-19 Ivan Nourdin , Giovanni Peccati , Anthony Réveillac

In this paper we discuss the natural candidate for the one dimensional free Poincar\'e inequality. Two main strong points sustain this candidacy. One is the random matrix heuristic and the other the relations with the other free functional…

Operator Algebras · Mathematics 2012-04-24 Michel Ledoux , Ionel Popescu

The aim of the present work is to show that recent results of the authors on the approximation of distributions of sums of independent summands by the infinitely divisible laws on convex polyhedra can be shown via an alternative class of…

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

We investigate Stein-Malliavin approximations for nonlinear functionals of geometric interest of Gaussian random eigenfunctions on the unit $d$ -dimensional sphere ${\mathbb{S}}^{d},$ $d\geq 2.$ All our results are established in the high…

Probability · Mathematics 2015-04-29 Domenico Marinucci , Maurizia Rossi

We are concerned with discretisations of the classical Kolmogorov equation by a standard space-time discontinuous Galerkin method. {The} Kolmogorov equation serves as simple, yet rich enough in the present context, model problem for a wide…

Numerical Analysis · Mathematics 2026-02-19 Zhaonan Dong , Emmanuil H. Georgoulis , Philip J. Herbert

We present a general numerical method for computing guaranteed two-sided bounds for principal eigenvalues of symmetric linear elliptic differential operators. The approach is based on the Galerkin method, on the method of a priori-a…

Numerical Analysis · Mathematics 2014-02-24 Ivana Šebestová , Tomáš Vejchodský

We derive Stein approximation bounds for functionals of uniform random variables, using chaos expansions and the Clark-Ocone representation formula combined with derivation and finite difference operators. This approach covers sums and…

Probability · Mathematics 2018-02-28 Nicolas Privault , Grzegorz Serafin

Given a reference random variable, we study the solution of its Stein equation and obtain universal bounds on its first and second derivatives. We then extend the analysis of Nourdin and Peccati by bounding the Fortet-Mourier and…

Probability · Mathematics 2017-12-13 Richard Eden , Juan Víquez

There is a recent and growing literature on large-width asymptotic and non-asymptotic properties of deep Gaussian neural networks (NNs), namely NNs with weights initialized as Gaussian distributions. For a Gaussian NN of depth $L\geq1$ and…

Machine Learning · Computer Science 2025-06-24 Alberto Bordino , Stefano Favaro , Sandra Fortini

We develop techniques for determining an explicit Berry-Esseen bound in the Kolmogorov distance for the normal approximation of a ratio of Gaussian functionals. We provide an upper bound in terms of the third and fourth cumulants, using…

Probability · Mathematics 2023-12-07 Khalifa Es-Sebaiy , Fares Alazemi

This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…

Combinatorics · Mathematics 2017-05-30 Matthew Yancey