Approximating geodesics via random points

DOI10.1214/18-AAP1414zbMath1466.60018arXiv1711.06952MaRDI QIDQ2415505

Sunder Sethuraman, Erik Davis

Publication date: 22 May 2019

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

shortest pathconsistencyscaling limitdistancegeodesicrandom geometric graphgamma convergenceFinsler

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Methods involving semicontinuity and convergence; relaxation (49J45) Geodesics in global differential geometry (53C22) Variational problems in applications to the theory of geodesics (problems in one independent variable) (58E10) Existence of optimal solutions to problems involving randomness (49J55)

Related Items (5)

Weighted lens depth: Some applications to supervised classification ⋮ Entropic Optimal Transport on Random Graphs ⋮ Gromov-Hausdorff limit of Wasserstein spaces on point clouds ⋮ Nonparametric analysis of non-Euclidean data on shapes and images ⋮ Nonhomogeneous Euclidean first-passage percolation and distance learning

This page was built for publication: Approximating geodesics via random points