arXiv (All)
open access
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 fo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- When Edge Independence Fails: Joint Graph Diffusion with Latent Sociability Priors#1291814
- UltraDiff: Transferring High-Fidelity Priors to Compressed Latent Spaces for High-Resolution Image Generation#1356538
- Popularity Regression-Based Latent Space Model for Large-Scale Sparse Network Analysis#1141327
- Your Discrete Graph Diffusion Model is Secretly Memorizing#1298282
- Your Discrete Graph Diffusion Model is Secretly Memorizing#1291808
Record · ID 1298261
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive