Research map / Graph learning / Graph algorithms and clustering
Edge-exchangeable graphs and sparsity
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace node exchangeability with edge exchangeability (permuting edges/steps rather than vertices) as the basis for random graph models | random graph models generally · theoretical (no experiments) | graph sparsity (sub-quadratic edge growth) | Helped |
| Use a completely random measure (generalized gamma style) edge-frequency model in the edge-exchangeable framework | edge-exchangeable graph model (Example on graph partitions) · theoretical (no experiments) | sparsity | No clear effect |
Closest papers by meaning
- When Edge Independence Fails: Joint Graph Diffusion with Latent Sociability Priors (NeurIPS 2026 · similarity 0.88)
- Generative Modelling of Structurally Constrained Graphs (NeurIPS 2024 · similarity 0.86)
- Fast Wasserstein rates for estimating probability distributions of probabilistic graphical models (NeurIPS 2026 · similarity 0.86)
- On the Role of Edge Dependency in Graph Generative Models (ICML 2024 · similarity 0.85)
- Transfer Learning for Latent Variable Network Models (NeurIPS 2024 · similarity 0.85)
- Transfer Learning on Edge Connecting Probability Estimation Under Graphon Model (NeurIPS 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.