Normal approximation for sums of discrete $U$-statistics - application to Kolmogorov bounds in random subgraph counting

Abstract

We derive normal approximation bounds in the Kolmogorov distance for sums of discrete multiple integrals and $U$-statistics made of independent Bernoulli random variables. Such bounds are applied to normal approximation for the renormalized subgraphs counts in the Erd{\H o}s-Rényi random graph. This approach completely solves a long-standing conjecture in the general setting of arbitrary graph counting, while recovering and improving recent results derived for triangles as well as results using the Wasserstein distance.