A Quantitative Local Limit Theorem for Triangles in Random Graphs

MaRDI QIDQ6278299zbMATH OpenFDO

Authors Ross Berkowitz

Publication date 5 October 2016

Abstract: In this paper we prove a quantiative local limit theorem for the distribution of the number of triangles in the ErdH{o}s-Renyi random graph $G(n,p)$, for a fixed $pin(0,1)$. This proof is an extension of the previous work of Gilmer and Kopparty, who proved that the local limit theorem held asymptotically for triangles. Our work gives bounds on the $el{l}^1$ and $el{l}^{i}nfty$ distance of the triangle distribution from a suitable discrete normal.

This page was built for publication: A Quantitative Local Limit Theorem for Triangles in Random Graphs

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