2000 character limit reached
Berry-Esseen-type estimates for random variables with a sparse dependency graph (2212.02590v2)
Published 5 Dec 2022 in math.PR
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]$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.