When Edge Independence Fails: Joint Graph Diffusion with Latent Sociability Priors

The paper identifies a limitation of discrete graph diffusion models: independent edge updates combined with exchangeability force the terminal prior to be an Erdős–Rényi graph, which hampers denoising and leads to loss of node heterogeneity. To overcome this, the authors propose a Latent Sociability Prior (LSP) and a joint diffusion process that co‑evolves latent sociability variables with graph structure, eliminating edge independence while maintaining exchangeability. Experiments on several graph generation datasets show that this approach better captures graph distributions than baseline methods that lack node features.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

• diffusion