Upper tails for homomorphism counts in sparse random hypergraphs

The "infamous upper tail problem" for $r$-uniform hypergraphs is to estimate the probability that the number of copies of a fixed hypergraph $H$ in a large binomial $r$-uniform hypergraph $\boldsymbol{G}$ exceeds its expectation by a constant factor. The problem was popularized by Janson and Ruci\'nski and, particularly in the case of graphs ($r=2$), has been a driving example in the development of nonlinear large deviations theory. Recent work of the first author with Dembo and Pham has accomplished the \emph{naive mean-field reduction step}, reducing the upper tail problem to an entropic variational problem on a space of weighted graphs. The latter was resolved for counts of $r$-uniform cliques and a certain linear 3-uniform hypergraph by Liu and Zhao, who also conjectured a general formula. We confirm their conjecture for other classes of hypergraphs, including complete $r$-partite $r$-graphs, tight cycles, and the Fano plane. We also prove a general large deviation upper bound for counts of $r$-graphs $H$ satisfying certain edge covering properties.