When Edge Independence Fails: Joint Graph Diffusion with Latent Sociability Priors
Discrete graph diffusion models corrupt graph structure through independent edge updates with a Markovian noise model. Combined with the exchangeability requirement on the output distribution, the terminal prior is necessarily an Erdős--Rényi (E-R) random graph. This has a fundamental consequence for unconditional graph generation without node features: in the large graph limit, any GNN denoiser…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
