Category: A1; Team name: louisvl; Dataset: GraphUniverse #248
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description
GraphUniverse [0] is a synthetic, generative graph dataset framework that creates families of graphs with controllable structural properties. Unlike traditional static datasets, GraphUniverse takes generation parameters as input to produce entire families of graphs with consistent semantic communities across different graph instances. This enables systematic evaluation of inductive generalization - how models perform on completely unseen graphs rather than just unseen parts of the same graph.
The framework generates graphs using an extended Degree-Corrected Stochastic Block Model (DC-SBM) with three hierarchical levels: Universe (global community properties), Family (generation constraints), and Graph (individual instances). Users specify parameters like homophily ranges, degree distributions, node counts, and community structures to generate graph families on-demand.
Two task configurations included:
[0] Anonymous (2025). GraphUniverse: Enabling Systematic Evaluation of Inductive Generalization. In Submitted to The Fourteenth International Conference on Learning Representations.
Caveat
This PR includes modifications to TopoBench's splitting utilities because GraphUniverse community-detection task is an inductive, node classification tasks that were not previously supported.
Changes made: