Local central limit theorem for triangle counts in sparse random graphs

DOI10.1017/S0305004125101345MaRDI QIDQ6858786zbMATH OpenFDO

Authors Pedro Araújo, Letícia Mattos

Publication date 12 February 2026

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0305004125101345

zbMATH Keywords

Gilmer-Kopparty conjecture

Mathematics Subject Classification ID

Characteristic functions; other transforms (60E10) Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3865331 (Why is no real title available?)
• scientific article; zbMATH DE number 3005966 (Why is no real title available?)
• A central limit theorem for decomposable random variables with applications to random graphs
• A local central limit theorem for triangles in a random graph
• Anti-concentration for subgraph counts in random graphs
• Combinatorial anti-concentration inequalities, with applications
• Concentration of multivariate polynomials and its applications
• Fundamentals of Stein's method
• Introduction to Random Graphs
• Local limit theorems for subgraph counts
• Local limit theorems via Landau-Kolmogorov inequalities
• Orthogonal decompositions and functional limit theorems for random graph statistics
• Poisson convergence and random graphs
• Probability
• Subgraph counts in random graphs using incomplete U-statistics methods
• The infamous upper tail
• When are small subgraphs of a random graph normally distributed?

This page was built for publication: Local central limit theorem for triangle counts in sparse random graphs

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