Upper tails for homomorphism counts in sparse random hypergraphs

Nicholas A. Cook, Nguyen Nguyen

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 hyp…