Skip to main content
Search

# TopoGED

1 related articles

Subscribe to updates
  1. arXiv

    Temporal graph prediction learns to sketch topology first: TopoGED lifts edge metrics from near zero across 14 datasets

    Temporal graph learning usually treats future prediction as scoring edges or node labels over a largely fixed node set, an assumption that collapses once new nodes arrive and the future graph becomes a new object in size and structure. TopoGED reframes the task as an inverse topology problem: predict a multiscale topological descriptor of the future graph, then reconstruct a future snapshot that realizes it under inductive constraints. Across 14 temporal graph datasets, its node-level macro average beats the strongest baseline, it wins most graph-structure metric evaluations, and its macro-average edge prediction metrics rise from near zero to a nonzero level.

You’re all caught up