Two-Sample Testing for Random Graphs without Vertex Correspondence
arXiv:2610.07503v1 Announce Type: new Abstract: 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. We study how many…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-10-07 04:00 · arXiv stat.ML
Two-Sample Testing for Random Graphs without Vertex Correspondence