DiPhon defines graphon diffusion via a Jacobi SDE for scalable graph generation, matching first moments exactly and preserving topology across sizes without retraining.
GraDE uses a graph diffusion estimator to score subgraph typicality and discovers large-scale neural architecture motifs with up to 30x higher median frequency than sampling methods.
MolHIT uses hierarchical discrete diffusion and decoupled atom encoding to generate molecular graphs with near-perfect validity, surpassing 1D baselines on MOSES.
In randomly ordered DAGs, relative counts increase monotonically along causal order, enabling recovery via sorting and yielding singular equivalence classes.
A neuro-symbolic framework pairs neural graph proposals with symbolic SMT solvers for hard-constraint satisfaction, achieving over 95% in-distribution and 64, 86% zero-shot rule compliance on the MolSAT benchmark.