Research map / Probabilistic and scientific modeling / Variational and generative sampling
Latent distance estimation for random geometric graphs
Ernesto Araya Valdivia, De Castro Yohann
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| Select the candidate dimension with the maximum eigenvalue-cluster gap score | HEiC dimension estimation · Synthetic W1 graphon on S^(d-1) | dimension identification | Improved |
Closest papers by meaning
- Node Regression on Latent Position Random Graphs via Local Averaging (JMLR 2026 · similarity 0.89)
- Hyperbolic Geometric Latent Diffusion Model for Graph Generation (ICML 2024 · similarity 0.85)
- Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits (NeurIPS 2024 · similarity 0.84)
- Aligning Embeddings and Geometric Random Graphs: Informational Results and Computational Approaches for the Procrustes-Wasserstein Problem (NeurIPS 2024 · similarity 0.84)
- GLAD: Improving Latent Graph Generative Modeling with Simple Quantization (AAAI 2025 · similarity 0.84)
- Node Similarities under Random Projections: Limits and Pathological Cases (ICLR 2025 · similarity 0.84)
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.
