Central limit theorems in the configuration model

We prove a general normal approximation theorem for local graph statistics in the configuration model, together with an explicit bound on the error in the approximation with respect to the Wasserstein metric. Such statistics take the form T := Sigma(v is an element of V) H-v, where V is the vertex set, and H-v depends on a neighbourhood in the graph around v of size at most l. The error bound is expressed in terms of l, vertical bar V vertical bar, an almost sure bound on H-v, the maximum vertex degree d(max) and the variance of T. Under suitable assumptions on the convergence of the empirical degree distributions to a limiting distribution, we deduce that the size of the giant component in the configuration model has asymptotically Gaussian fluctuations.