A large deviation principle for the Erd\H{o}s-R\'enyi uniform random graph

Starting with the large deviation principle (LDP) for the ErdH{o}s-Ru0027enyi binomial random graph $mathcal{G}(n,p)$ (edge indicators are i.i.d.), due to Chatterjee and Varadhan (2011), we derive the LDP for the uniform random graph $mathcal{G}(n,m)$ (the uniform distribution over graphs with $n$ vertices and $m$ edges), at suitable $m=m_n$. Applying the latter LDP we find that tail decays for subgraph counts in $mathcal{G}(n,m_n)$ are controlled by variational problems, which up to a constant shift, coincide with those studied by Kenyon et al. and Radin et al. in the context of constrained random graphs, e.g., the edge/triangle model.