Abstract
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 wh......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
