Shortest Path through Random Points

  title={Shortest Path through Random Points},
  author={Sung Jin Hwang and Steven Benjamin Damelin and Alfred O. Hero},
  journal={arXiv: Probability},
Let $(M,g_1)$ be a complete $d$-dimensional Riemannian manifold for $d > 1$. Let $\mathcal X_n$ 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 $\mathcal X_n$ converges almost surely to a constant multiple of the Riemannian distance between $x,y$ under the metric tensor $g_p = f^{2(1-p)/d} g_1$, where $p > 1$ is… 

Figures from this paper

Approximating geodesics via random points
Given a `cost' functional $F$ on paths $\gamma$ in a domain $D\subset\mathbb{R}^d$, in the form $F(\gamma) = \int_0^1 f(\gamma(t),\dot\gamma(t))dt$, it is of interest to approximate its minimum cost
Gromov–Hausdorff limit of Wasserstein spaces on point clouds
We consider a point cloud $X_n := \{ x_1, \dots, x_n \}$ uniformly distributed on the flat torus $\mathbb{T}^d : = \mathbb{R}^d / \mathbb{Z}^d $, and construct a geometric graph on the cloud by
Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph
This paper gives the first exact algorithm for computing a data-sensitive metric called the nearest neighbor metric, and proves the surprising result that a previously published $3-approximation is an exact algorithm.
Exploration of a Graph-based Density-sensitive Metric
This paper shows that the edge-squared metric is equal to previously studied geodesic-based metric defined on points in Euclidean space, and gives fast algorithms to compute sparse spanners of this distance.
Entropic Optimal Transport in Random Graphs
This paper shows that it is possible to consistently estimate entropic-regularized Optimal Transport (OT) distances between groups of nodes in the latent space, and provides a general stability result forEntropic OT with respect to perturbations of the cost matrix.
Intrinsic Metrics: Exact Equality between a Geodesic Metric and a Graph metric
Some researchers have proposed using non-Euclidean metrics for clustering data points. Generally, the metric should recognize that two points in the same cluster are close, even if their Euclidean
Convergence rates for estimators of geodesic distances and Frèchet expectations
This paper deals with the study of a natural estimator for the geodesic distance on M, and proves a general convergence result under rather general geometric assumptions on M.
Nonhomogeneous Euclidean first-passage percolation and distance learning
Consider an i.i.d. sample from an unknown density function supported on an unknown manifold embedded in a high dimensional Euclidean space. We tackle the problem of learning a distance between
Shortest path distance in random k-nearest neighbor graphs
It is proved that for unweighted kNN graphs, this distance converges to an unpleasant distance function on the underlying space whose properties are detrimental to machine learning.
Analysis of Distance Functions in Graphs
It is shown that in unweighted k-nearest neighbor graphs, the shortest path distance converges to an unpleasant distance function whose properties are detrimental to some machine learning problems.


Limit theory for point processes in manifolds
Let Yi;i ‚ 1; be i.i.d. random variables having values in an m-dimensional manifold M ‰ R d and consider sums P n=1 »(n 1=m Yi;fn 1=m Yig n=1 ), where » is a real valued function deflned on pairs
A Shape Theorem for Riemannian First-Passage Percolation
Riemannian first-passage percolation (FPP) is a continuum model, with a distance function arising from a random Riemannian metric in $\R^d$. Our main result is a shape theorem for this model, which
Asymptotics for weighted minimal spanning trees on random points
For all p[greater-or-equal, slanted]1 let Mp(X1,...,Xn) denote the length of the minimal spanning tree through random variables X1,...,Xn, where the cost of an edge (Xi, Xj) is given by Xi-Xjp. If
Geodesic entropic graphs for dimension and entropy estimation in manifold learning
This paper focuses on the geodesic-minimal-spanning-tree (GMST) method, which uses the overall lengths of the MSTs to simultaneously estimate manifold dimension and entropy.
1. Let be a probability space and,be an increasing family of sub o'-fields of(we put(c) Let (xn)n=1, 2, •c be a sequence of bounded martingale differences on , that is,xn(ƒÖ) is bounded almost surely
Concentration of measure and isoperimetric inequalities in product spaces
The concentration of measure phenomenon in product spaces roughly states that, if a set A in a product ΩN of probability spaces has measure at least one half, “most” of the points of Ωn are “close”
A note on two problems in connexion with graphs
  • E. Dijkstra
  • Mathematics, Computer Science
    Numerische Mathematik
  • 1959
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Semi-Riemannian Geometry
This chapter develops the basics of differentiable manifolds and semi-Riemannian geometry for the applications in general relativity. It will introduce finitistic substitutes for basic topological
Euclidean models of first-passage percolation
Summary. We introduce a new family of first-passage percolation (FPP) models in the context of Poisson-Voronoi tesselations of ℝd. Compared to standard FPP on ℤd, these models have some technical
Spatial Point Processes and their Applications
These lectures will introduce some basic techniques for constructing, manipulating and analysing spatial point patterns.