Berry-Esseen-type estimates for random variables with a sparse dependency graph
Abstract
We obtain Berry-Esseen-type bounds for the sum of random variables with a dependency graph and uniformly bounded moments of order δ ∈ (2,∞] 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δ for some δ∈(2,∞].
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.