A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs

From MaRDI portal
(Redirected from Publication:6063347)



Abstract: Given a graph sequence Gnnge1 and a simple connected subgraph H, we denote by T(H,Gn) the number of monochromatic copies of H in a uniformly random vertex coloring of Gn with cge2 colors. In this article, we prove a central limit theorem for T(H,Gn) with explicit error rates. The error rates arise from graph counts of collections formed by joining copies of H that we call good joins. Counts of good joins are closely related to the fourth moment of a normalized version of T(H,Gn), and that connection allows us to show a fourth moment phenomenon for the central limit theorem. Precisely, for cge30, we show that T(H,Gn) (appropriately centered and rescaled) converges in distribution to mathcalN(0,1) whenever its fourth moment converges to 3 (the fourth moment of the standard normal distribution). We show the convergence of the fourth moment is necessary to obtain a normal limit when cge2. The combination of these results implies that the fourth moment condition characterizes the limiting normal distribution of T(H,Gn) for all subgraphs H, whenever cge30.












This page was built for publication: A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063347)