2000 character limit reached
Characterizing the fourth-moment phenomenon of monochromatic subgraph counts via influences (2403.14068v1)
Published 21 Mar 2024 in math.PR and math.CO
Abstract: We investigate the distribution of monochromatic subgraph counts in random vertex $2$-colorings of large graphs. We give sufficient conditions for the asymptotic normality of these counts and demonstrate their essential necessity (particularly for monochromatic triangles). Our approach refines the fourth-moment theorem to establish new, local influence-based conditions for asymptotic normality; these findings more generally provide insight into fourth-moment phenomena for a broader class of Rademacher and Gaussian polynomials.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.