On the Estimation of Latent Distances Using Graph Distances

11 Aug 2020 Arias-Castro Ery Channarond Antoine Pelletier Bruno Verzelen Nicolas

We are given the adjacency matrix of a geometric graph and the task of recovering the latent positions. We study one of the most popular approaches which consists in using the graph distances and derive error bounds under various assumptions on the link function... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • STATISTICS THEORY
  • METRIC GEOMETRY
  • STATISTICS THEORY