Modular statistics for subgraph counts in sparse random graphs

Bobby DeMarco, Jeff Kahn, Amanda Redlich

Answering a question of Kolaitis and Kopparty, we show that, for given integer $q>1$ and pairwise nonisomorphic connected graphs $G_1...G_k$, if $p=p(n)$ is such that $\Pr(G_{n,p}…