Normal approximation for subgraph count in random hypergraphs

DOI10.1002/JGT.70066MaRDI QIDQ7314105zbMATH OpenFDO

Authors Mikołaj Nieradko, Wojciech Michalczuk, Grzegorz Serafin

Publication date 13 August 2026

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/JGT.70066

Mathematics Subject Classification ID

Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Central limit and other weak theorems (60F05)

Cites work

• A central limit theorem for decomposable random variables with applications to random graphs
• A central limit theorem for generalized multilinear forms
• A central limit theorem for generalized quadratic forms
• A central limit theorem with applications to random hypergraphs
• A Class of Statistics with Asymptotically Normal Distribution
• Asymptotic normality of the size of the giant component in a random hypergraph
• Berry-Esseen bounds for functionals of independent random variables
• Berry-Esseen bounds for generalized U-statistics
• Central limit theorems for sequences of multiple stochastic integrals
• Chaos of a Markov operator and the fourth moment condition
• Configuration models of random hypergraphs
• Exploring hypergraphs with martingales
• scientific article; zbMATH DE number 2127720 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Introduction to Random Graphs
• Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method
• KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH
• Normal approximation for generalized \(U\)-statistics and weighted random graphs
• Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
• On the fourth moment condition for Rademacher chaos
• On the upper tail problem for random hypergraphs
• Quantitative de Jong theorems in any dimension
• Regularity method and large deviation principles for the Erd\H{o}s--R\'enyi hypergraph
• Structure of large random hypergraphs
• Subhypergraphs in non-uniform random hypergraphs
• The asymptotic distributions of generalized U-statistics with applications to random graphs
• The Berry-Esseen bound in de Jong's CLT
• The lower tail: Poisson approximation revisited
• The phase transition in a random hypergraph
• When are small subgraphs of a random graph normally distributed?

This page was built for publication: Normal approximation for subgraph count in random hypergraphs

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