On the estimation of latent distances using graph distances

DOI10.1214/21-EJS1801zbMath1471.62369arXiv1804.10611OpenAlexW2798873678MaRDI QIDQ2044319

Antoine Channarond, Ery Arias-Castro, Nicolas Verzelen, Bruno Pelletier

Publication date: 9 August 2021

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.10611

zbMATH Keywords

graph embeddingmultidimensional scalingrandom geometric graphsgraph distanceslatent positions

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Applications of graph theory (05C90) Probabilistic graphical models (62H22)

Related Items (3)

Entropic Optimal Transport on Random Graphs ⋮ Projective, sparse and learnable latent position network models ⋮ Unnamed Item

Uses Software

• smacof

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Consistency thresholds for the planted bisection model
• Universally consistent vertex classification for latent positions graphs
• Modeling graphs using dot product representations
• Spectral clustering and the high-dimensional stochastic blockmodel
• Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
• Modern multidimensional scaling: theory and applications
• Worst-case versus average-case design for estimation from partial pairwise comparisons
• Consistency of spectral clustering in stochastic block models
• The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Multidimensional scaling. I: Theory and method
• Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
• ASAP: An Eigenvector Synchronization Algorithm for the Graph Realization Problem
• Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
• Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
• Mixed membership stochastic blockmodels
• Random Geometric Graphs
• Latent Space Approaches to Social Network Analysis
• Community Detection and Stochastic Block Models
• A Quest to Unravel the Metric Structure Behind Perturbed Networks
• A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
• Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning
• Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Drawing, and Proximity Analysis
• Persistence-Based Clustering in Riemannian Manifolds
• Random Dot Product Graph Models for Social Networks

This page was built for publication: On the estimation of latent distances using graph distances