Papers
Topics
Authors
Recent
Search
2000 character limit reached

Berry-Esseen-type estimates for random variables with a sparse dependency graph

Published 5 Dec 2022 in math.PR | (2212.02590v2)

Abstract: We obtain Berry-Esseen-type bounds for the sum of random variables with a dependency graph and uniformly bounded moments of order $\delta \in (2,\infty]$ using a Fourier transform approach. Our bounds improve the state-of-the-art in the regime where the degree of the dependency graph is large. As a Corollary of our results, we obtain a Central Limit Theorem for random variables with a sparse dependency graph that are uniformly bounded in $L{\delta}$ for some $\delta\in(2,\infty]$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 5 likes about this paper.