2000 character limit reached
Berry--Esseen bounds for generalized $U$ statistics (2104.03479v1)
Published 8 Apr 2021 in math.PR
Abstract: In this paper, we establish optimal Berry--Esseen bounds for the generalized $U$-statistics. The proof is based on a new Berry--Esseen theorem for exchangeable pair approach by Stein's method under a general linearity condition setting. As applications, an optimal convergence rate of the normal approximation for subgraph counts in Erd\"os--R\'enyi graphs and graphon-random graph is obtained.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.