Explicit error bounds for lattice Edgeworth expansions

10/24/2017
by   J. P. Buhler, et al.
0

Motivated, roughly, by comparing the mean and median of an IID sum of bounded lattice random variables, we develop explicit and effective bounds on the errors involved in the one-term Edgeworth expansion for such sums.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/14/2021

Explicit non-asymptotic bounds for the distance to the first-order Edgeworth expansion

In this article, we study bounds on the uniform distance between the cum...
08/24/2018

Non-asymptotic bounds for percentiles of independent non-identical random variables

This note displays an interesting phenomenon for percentiles of independ...
04/13/2021

A Refined Probabilistic Error Bound for Sums

This paper considers a probabilistic model for floating-point computatio...
10/12/2019

Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids

We prove that the universal theory and the quasi-equational theory of bo...
06/25/2019

Probabilistic Error Analysis for Inner Products

Probabilistic models are proposed for bounding the forward error in the ...
04/25/2022

Explicit Lower Bounds Against Ω(n)-Rounds of Sum-of-Squares

We construct an explicit family of 3-XOR instances hard for Ω(n)-levels ...
10/21/2019

Finding duality for Riesz bases of exponentials on multi-tiles

It is known that if Ω⊂R^d is bounded, measurable set that forms a k-tili...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.