On the estimation of latent distances using graph distances
From MaRDI portal
Publication:2044319
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 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.
Recommendations
- On estimation and inference in latent structure random graphs
- Distance metric learning for graph structured data
- Low rank estimation of similarities on graphs
- Distance Measures for Embedded Graphs
- Distance measures for embedded graphs
- Intrinsic graph structure estimation using graph Laplacian
- Laplacian and normalized Laplacian spectral distances of graphs
- Sketching earth-mover distance on graph metrics
- Modeling Network Populations via Graph Distances
- scientific article; zbMATH DE number 2163513
Cites work
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- A Quest to Unravel the Metric Structure Behind Perturbed Networks
- A tensor approach to learning mixed membership community models
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- ASAP: an eigenvector synchronization algorithm for the graph realization problem
- Community detection and stochastic block models: recent developments
- Consistency of spectral clustering in stochastic block models
- scientific article; zbMATH DE number 3152611 (Why is no real title available?)
- scientific article; zbMATH DE number 847276 (Why is no real title available?)
- scientific article; zbMATH DE number 3073477 (Why is no real title available?)
- Latent Space Approaches to Social Network Analysis
- Local multidimensional scaling for nonlinear dimension reduction, graph drawing, and proximity analysis
- Mixed membership stochastic blockmodels
- Modeling graphs using dot product representations
- Modern multidimensional scaling: theory and applications
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Multidimensional scaling. I: Theory and method
- Persistence-based clustering in Riemannian manifolds
- Perturbation bounds for procrustes, classical scaling, and trilateration, with applications to manifold learning
- Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
- Random Dot Product Graph Models for Social Networks
- Random Geometric Graphs
- Spectral clustering and the high-dimensional stochastic blockmodel
- Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
- Universally consistent vertex classification for latent positions graphs
- Worst-case versus average-case design for estimation from partial pairwise comparisons
Cited in
(6)- Universally consistent vertex classification for latent positions graphs
- scientific article; zbMATH DE number 1890143 (Why is no real title available?)
- scientific article; zbMATH DE number 7626706 (Why is no real title available?)
- Entropic Optimal Transport on Random Graphs
- Projective, sparse and learnable latent position network models
- Reconstruction of random geometric graphs: breaking the \(\varOmega (r)\) distortion barrier
This page was built for publication: On the estimation of latent distances using graph distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2044319)
