arXiv (All)
open access
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. We study how many graphs such an unaligned two-sample test needs,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Tests of graph homogeneity, subgraph counts, and quasirandomness#822606
- Zero-Flow Two-Sample Tests#1143852
- Two-Sample Testing via Generative Processes#1218012
- Subgraph Counting with Local Node Differential Privacy#1357933
- Subgraph Counting with Local Node Differential Privacy#1348761
Record · ID 1216878
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive