A probabilistic approach to local limit theorems with applications to random graphs

In this article, we develop a general method to obtain local limit theorems from distributional limit theorems. Our results use probabilistic arguments and yield explicit bounds on the quality of approximation. We use the method to obtain new local limit theorems for the number of isolated vertices and the number of triangles in an Erd\H{o}s-R\'enyi random graph.