SOURCE-LINKED INTELLIGENCE

Embedded Graph Flows for Categorical Graph Generation

arXiv · AI, language, vision and robotics · article · Sep 4, 2026 · UTC

Generating categorical graphs requires choosing node and edge types that form a coherent structure without depending on node order. Many graph generators encode categories as fixed one-hot vectors, which can impose an artificial geometry in which categories are equidistant. We propose Embedded Graph Flows (EGF), a generative model that learns continuous embeddings for node and unordered-edge categories and transports Gaussian noise towards these learnt endpoints using a permutation-equivariant graph transformer. A terminal readout maps the embeddings back to discrete graph categories. Across m

Read original source ↗ Open in workspace

recordType

paper

region

Global