Local large deviations for triangles in sparse random graphs
We revisit a classic topic in probabilistic combinatorics, the lower-tail large-deviation problem for triangles in the random graph $G(n,p)$. Here we aim for first-order asymptotics for the quantity $\mathbb{P}[X=k]$ with $X$ the number of triangles in $G(n,p)$ and $0 \le k \le (1-\epsilon) \mathbb{E}X$, in the sparse...