A local central limit theorem for triangles in a random graph

DOI10.1002/rsa.20604zbMath1343.05136arXiv1412.0257OpenAlexW2262319220MaRDI QIDQ5740273

Swastik Kopparty, Justin Gilmer

Publication date: 25 July 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random graphlocal limit theoremnumber of triangles

Mathematics Subject Classification ID

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

Related Items

Local limit theorems and mod-phi convergence ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon ⋮ Local limit theorems for subgraph counts ⋮ Anti-concentration for subgraph counts in random graphs ⋮ Combinatorial anti-concentration inequalities, with applications ⋮ Number of arithmetic progressions in dense random subsets of \(\mathbb{Z}/n\mathbb{Z}\)

Cites Work

• Unnamed Item
• When are small subgraphs of a random graph normally distributed?
• Subgraph counts in random graphs using incomplete U-statistics methods
• Poisson approximation for dependent trials
• A central limit theorem for decomposable random variables with applications to random graphs
• Triangles in random graphs
• Modular statistics for subgraph counts in sparse random graphs
• Local limit theorems via Landau-Kolmogorov inequalities
• The order of the giant component of random hypergraphs
• Orthogonal decompositions and functional limit theorems for random graph statistics
• Random graphs and the parity quantifier
• Probability