mlsanityData to 7 Oct 2026

Manifold structure in graph embeddings

arXiv 2006.05168 ↗First posted 9 Jun 2020stat.ML cs.LGcited by 17

Not on the map. Why?

Abstract (arXiv)

Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is often available. In spectral embedding, this dimension may be very high. However, this paper shows that existing random graph models, including graphon and other latent position models, predict the data should live near a much lower-dimensional set. One may therefore circumvent the curse of dimensionality by employing methods which exploit hidden manifold structure.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 5; 2022: 3; 2023: 3; 2024: 1; 2025: 3; 2026: 2.

17 papers.

Sort: