Two-Sample Testing for Random Graphs without Vertex Correspondence

Two populations of graphs often have to be compared without any correspondence between their vertices, for instance when networks come from different communities, or when a graph generative model is evaluated against held-out graphs.