Research map / Graph learning / Graph self-supervised learning
Asymptotics of Network Embeddings Learned via Subsampling
Andrew Davison, Morgane Austern
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Asymptotics of $\ell_2$ Regularized Network Embeddings (NeurIPS 2022 · similarity 0.95)
- Community Detection Guarantees using Embeddings Learned by Node2Vec (NeurIPS 2024 · similarity 0.90)
- How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings (ICLR 2025 · similarity 0.89)
- Information Loss and Disparate Effects in Network Embeddings (NeurIPS 2026 · similarity 0.88)
- Learning Representations for Hierarchies with Minimal Support (NeurIPS 2024 · similarity 0.88)
- Weighted Embeddings for Low-Dimensional Graph Representation (AAAI 2025 · similarity 0.88)
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.
