KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH

DOI10.1017/S0269964821000061zbMath1504.05267arXiv1704.00410OpenAlexW3135767135MaRDI QIDQ5051220

Adrian Roellin

Publication date: 22 November 2022

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.00410

zbMATH Keywords

Stein's methodrandom graphssubgraph countsStein-Tikhomirov method

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items (6)

Wasserstein-2 bounds in normal approximation under local dependence ⋮ The number of triangles in random intersection graphs ⋮ Kolmogorov bounds for decomposable random variables and subgraph counting by the Stein-Tikhomirov method ⋮ Error bounds in local limit theorems using Stein's method ⋮ Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting ⋮ Berry-Esseen bounds for generalized \(U\)-statistics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of Stein's method
• On normal approximations of distributions in terms of dependency graphs
• When are small subgraphs of a random graph normally distributed?
• Normal fluctuations and the FKG inequalities
• The distribution of leading digits and uniform distribution mod 1
• A central limit theorem for decomposable random variables with applications to random graphs
• Normal approximation under local dependence.
• Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
• Local limit theorems via Landau-Kolmogorov inequalities
• Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation
• On the Convergence Rate in the Central Limit Theorem for Weakly Dependent Random Variables
• Two central limit problems for dependent random variables
• Association of Random Variables, with Applications

This page was built for publication: KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH