Upper tails of subgraph counts in directed random graphs

Jiyun Park

The upper tail problem in a sparse Erdős-Rényi graph asks for the probability that the number of copies of some fixed subgraph exceeds its expected value by a constant factor. We s…