Shortest path through random points

DOI10.1214/15-AAP1162zbMath1353.60028arXiv1202.0045MaRDI QIDQ350693

Steven B. Damelin, Sung Jin Hwang, Alfred O. III Hero

Publication date: 9 December 2016

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

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

zbMATH Keywords

shortest pathRiemannian geometryconformal metricalmost sure convergencerandom pointspower-weighted graph

Mathematics Subject Classification ID

Strong limit theorems (60F15) Methods of local Riemannian geometry (53B21)

Related Items (8)

Balancing Geometry and Density: Path Distances on High-Dimensional Data ⋮ Approximating Nearest Neighbor Distances ⋮ Weighted lens depth: Some applications to supervised classification ⋮ Continuous approximation formulas for location problems ⋮ Entropic Optimal Transport on Random Graphs ⋮ Convergence rates for estimators of geodesic distances and Frèchet expectations ⋮ Gromov-Hausdorff limit of Wasserstein spaces on point clouds ⋮ Nonhomogeneous Euclidean first-passage percolation and distance learning

This page was built for publication: Shortest path through random points