Consider a sample of points drawn from some unknown density on $R^d$. Assume the only information we have about the sample are the $k$-nearest neighbor relationships: we know who is among the $k$-nearest neighors of whom, but we do not know any distances between points, nor the point coordinates themselves. We prove that as the sample size goes to infinty, it is possible to reconstruct the underlying density p and the distances of the points (up to a multiplicative constant).

$k$-nearest neighbor graph - random geometric graph - ordinal embedding[-]