Research map / Graph learning / Graph algorithms and clustering
Maximum Likelihood Embedding of Logistic Random Dot Product Graphs
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.
Closest papers by meaning
- Out-of-sample extension of graph adjacency spectral embedding (ICML 2018 · similarity 0.89)
- On the Effect of Misspecifying the Embedding Dimension in Low-rank Network Models (ICML 2026 · similarity 0.88)
- Node Similarities under Random Projections: Limits and Pathological Cases (ICLR 2025 · similarity 0.87)
- GLAD: Improving Latent Graph Generative Modeling with Simple Quantization (AAAI 2025 · similarity 0.86)
- Hyperbolic Geometric Latent Diffusion Model for Graph Generation (ICML 2024 · similarity 0.85)
- Optimal Graph Clustering without Edge Density Signals (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.