Normal approximation and fourth moment theorems for monochromatic triangles
DOI10.1002/rsa.21017zbMath1526.05045arXiv2004.05732OpenAlexW3160416343WikidataQ113913009 ScholiaQ113913009MaRDI QIDQ6074673
No author found.
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.05732
graph coloringrates of convergencefourth-moment theorembirthday problemmartingale central limit theorem
Central limit and other weak theorems (60F05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A non-uniform birthday problem with applications to discrete logarithms
- Quantitative de Jong theorems in any dimension
- Collision times in multicolor urn models and sequential graph coloring with applications to discrete logarithms
- Universal limit theorems in graph coloring problems with connections to extremal combinatorics
- Stein's method on Wiener chaos
- A central limit theorem for generalized multilinear forms
- A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm
- Exchangeable pairs and Poisson approximation
- A central limit theorem for generalized quadratic forms
- Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- On the number of copies of one hypergraph in another
- On the fourth moment condition for Rademacher chaos
- The matching, birthday and the strong birthday problem: a contemporary review
- Monochromatic subgraphs in randomly colored graphons
- Universality of the mean-field for the Potts model
- Central limit theorems for sequences of multiple stochastic integrals
- 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
- Normal Approximations with Malliavin Calculus
- Multicollision Attacks on Some Generalized Sequential Hash Functions
- Hypergraphs, Entropy, and Inequalities
- Collision-based Testers are Optimal for Uniformity and Closeness
- Testing Closeness of Discrete Distributions
- On the Departure from Normality of a Certain Class of Martingales
- A Class of Statistics with Asymptotically Normal Distribution
This page was built for publication: Normal approximation and fourth moment theorems for monochromatic triangles
