## Abstract

Given a cost functional F on paths γ in a domain D ⊂ R ^{d} , in the form F(γ) = _{0} ^{1} f (γ (t), γ (t))dt, it is of interest to approximate its minimum cost and geodesic paths. Let X _{1} , . . ., X _{n} be points drawn independently from D according to a distribution with a density. Form a random geometric graph on the points where X _{i} and X _{j} are connected when 0 < |X _{i} − X _{j} | < ε, and the length scale ε = ε _{n} vanishes at a suitable rate. For a general class of functionals F, associated to Finsler and other distances on D, using a probabilistic form of Gamma convergence, we show that the minimum costs and geodesic paths, with respect to types of approximating discrete cost functionals, built from the random geometric graph, converge almost surely in various senses to those corresponding to the continuum cost F, as the number of sample points diverges. In particular, the geodesic path convergence shown appears to be among the first results of its kind.

Original language | English (US) |
---|---|

Pages (from-to) | 1446-1486 |

Number of pages | 41 |

Journal | Annals of Applied Probability |

Volume | 29 |

Issue number | 3 |

DOIs | |

State | Published - Jan 1 2019 |

## Keywords

- Consistency
- Distance
- Finsler
- Gamma convergence
- Geodesic
- Random geometric graph
- Scaling limit
- Shortest path

## ASJC Scopus subject areas

- Statistics and Probability
- Statistics, Probability and Uncertainty