This is the public, feature-limited version of the conference webpage. After Registration and login please visit the full version.

Manifold structure in graph embeddings

Patrick Rubin-Delanchy

Spotlight presentation: Orals & Spotlights Track 05: Clustering/Ranking
on 2020-12-08T07:30:00-08:00 - 2020-12-08T07:40:00-08:00
Poster Session 2 (more posters)
on 2020-12-08T09:00:00-08:00 - 2020-12-08T11:00:00-08:00
Abstract: 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.

Preview Video and Chat

To see video, interact with the author and ask questions please use registration and login.