Open Access
October 2016 Shortest path through random points
Sung Jin Hwang, Steven B. Damelin, Alfred O. Hero III
Ann. Appl. Probab. 26(5): 2791-2823 (October 2016). DOI: 10.1214/15-AAP1162

Abstract

Let (M,g1) be a complete d-dimensional Riemannian manifold for d>1. Let Xn be a set of n sample points in M drawn randomly from a smooth Lebesgue density f supported in M. Let x,y be two points in M. We prove that the normalized length of the power-weighted shortest path between x,y through Xn converges almost surely to a constant multiple of the Riemannian distance between x,y under the metric tensor gp=f2(1p)/dg1, where p>1 is the power parameter.

Citation

Download Citation

Sung Jin Hwang. Steven B. Damelin. Alfred O. Hero III. "Shortest path through random points." Ann. Appl. Probab. 26 (5) 2791 - 2823, October 2016. https://doi.org/10.1214/15-AAP1162

Information

Received: 1 February 2013; Revised: 1 November 2015; Published: October 2016
First available in Project Euclid: 19 October 2016

zbMATH: 1353.60028
MathSciNet: MR3563194
Digital Object Identifier: 10.1214/15-AAP1162

Subjects:
Primary: 60F15
Secondary: 53B21 , 60C05

Keywords: conformal metric , power-weighted graph , Riemannian geometry , Shortest path

Rights: Copyright © 2016 Institute of Mathematical Statistics

Vol.26 • No. 5 • October 2016
Back to Top