Tests of graph homogeneity, subgraph counts, and quasirandomness
Homogeneous random graphs, also known as Erd{\H os}-R\'enyi graphs, are a subset of the family of dense random graphs, specified by a graphon. We analyze several goodness-of-fit tests for these models that are based on subgraph counts. To obtain the limiting null distribution of the test statistics we use a decompositi...