On the Estimation of Latent Distances Using Graph Distances - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Journal of Statistics Année : 2021

On the Estimation of Latent Distances Using Graph Distances

Résumé

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 an indicator function, the bound is (nearly) optimal as it (nearly) matches an information lower bound.
Fichier principal
Vignette du fichier
1804.10611.pdf (1.11 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02376073 , version 1 (22-11-2019)

Identifiants

Citer

Ery Arias-Castro, Antoine Channarond, Bruno Pelletier, Nicolas Verzelen. On the Estimation of Latent Distances Using Graph Distances. Electronic Journal of Statistics , 2021, 15 (1), pp.722-747. ⟨10.1214/21-EJS1801⟩. ⟨hal-02376073⟩
85 Consultations
55 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More