Nonlinear lower-tail large deviations at criticality

Source abstract

We introduce general methods to derive lower tail large deviation principles, for a variety of nonlinear problems of combinatorial interest. These methods are especially effective in "critical" regimes, where the nonlinearities are not sparse enough for Poissonian lower tails (e.g., Janson's inequality does not provide a sharp tail bound), but the situation is not so dense that combinatorial effects dominate (e.g., we cannot directly apply the theory of hypergraph containers or the relative entropy framework of Kozma-Samotij). In particular, these are regimes where one expects interesting phase transitions to occur. Our results have a number of consequences related to subgraphs in random graphs, answering various questions of Warnke and Jenssen-Perkins-Potukuchi-Simkin. For example, consider a random graph $G\sim \mathbb G(n,p)$, and let $L_\triangle(n,p)=\log\Pr[G\text{ is triangle-free}]$. The first-order asymptotics of $L_\triangle(n,p)$ have long been known in all parameter ranges except the critical regime where $p$ has order of magnitude $1/\sqrt n$. We are able to fill this gap: for any fixed $c>0$, we show that $n^{-3/2}L_\triangle(n,c/\sqrt n)$ converges to a limit expressed in terms of a two-parameter variational problem, which has a single phase transition at $c\approx 4.341$. In contrast, we show that there is no such phase transition for the probability that $G$ is $C_{2\ell}$-free, for any fixed even cycle $C_{2\ell}$. We also obtain some applications in combinatorial design theory. Addressing conjectures of Glock-Kühn-Lo-Osthus, Kelly, and Kwan-Sah-Sawhney-Simkin, we obtain new estimates on the number of order-$n$ Steiner triple systems with no Pasch configuration and the number of order-$n$ Latin squares with no $2\times 2$ Latin subsquare (both tight up to a factor of $\exp(o(n^2))$).