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. In the simplest case where the link function is proportional to an indicator function, the bound matches an information lower bound that we derive.

PDF Abstract

Code
Add Remove Mark official

No code implementations yet. Submit your code now

Categories

Statistics Theory Metric Geometry Statistics Theory
Contact us on: hello@paperswithcode.com . Papers With Code is a free resource with all data licensed under CC-BY-SA.
Terms Data policy Cookies policy