A fourth‐moment phenomenon for asymptotic normality of monochromatic subgraphs
From MaRDI portal
(Redirected from Publication:6063347)
Abstract: Given a graph sequence and a simple connected subgraph , we denote by the number of monochromatic copies of in a uniformly random vertex coloring of with colors. In this article, we prove a central limit theorem for with explicit error rates. The error rates arise from graph counts of collections formed by joining copies of that we call good joins. Counts of good joins are closely related to the fourth moment of a normalized version of , and that connection allows us to show a fourth moment phenomenon for the central limit theorem. Precisely, for , we show that (appropriately centered and rescaled) converges in distribution to 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 . The combination of these results implies that the fourth moment condition characterizes the limiting normal distribution of for all subgraphs , whenever .
Recommendations
- Normal approximation and fourth moment theorems for monochromatic triangles
- A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs
- Monochromatic subgraphs in randomly colored graphons
- Limit theorems for monochromatic stars
- The Second-Moment Phenomenon for Monochromatic Subgraphs
Cites work
- A Class of Statistics with Asymptotically Normal Distribution
- A non-uniform birthday problem with applications to discrete logarithms
- A Poisson approximation for coloured graphs under exchangeability
- A universal error bound in the CLT for counting monochromatic edges in uniformly colored graphs
- Asymptotic distribution for the birthday problem with multiple coincidences, via an embedding of the collision process
- Central limit theorems for sequences of multiple stochastic integrals
- Collision times in multicolor urn models and sequential graph coloring with applications to discrete logarithms
- scientific article; zbMATH DE number 52632 (Why is no real title available?)
- Hypergraphs, entropy, and inequalities
- Limit theorems for monochromatic stars
- Monochromatic subgraphs in randomly colored graphons
- Motif estimation via subgraph sampling: the fourth-moment phenomenon
- Multicollision Attacks on Some Generalized Sequential Hash Functions
- Normal approximation and fourth moment theorems for monochromatic triangles
- Normal approximations with Malliavin calculus. From Stein's method to universality
- On the Departure from Normality of a Certain Class of Martingales
- Stein's method on Wiener chaos
- Testing closeness of discrete distributions
- The matching, birthday and the strong birthday problem: a contemporary review
- The Second-Moment Phenomenon for Monochromatic Subgraphs
- Universal limit theorems in graph coloring problems with connections to extremal combinatorics
Cited in
(5)- The Second-Moment Phenomenon for Monochromatic Subgraphs
- Normal approximation and fourth moment theorems for monochromatic triangles
- Fluctuations of quadratic chaos
- Characterizing the fourth-moment phenomenon of monochromatic subgraph counts via influences
- Joint Poisson convergence of monochromatic hyperedges in multiplex hypergraphs
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)