Approximating geodesics via random points

Erik Davis, Sunder Sethuraman

Research output: Contribution to journalArticle

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

Original languageEnglish (US)
Pages (from-to)1446-1486
Number of pages41
JournalAnnals of Applied Probability
Volume29
Issue number3
DOIs
StatePublished - Jan 1 2019

Fingerprint

Geodesic
Random Geometric Graph
Path
Costs
Research and Development
Form
Graph

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

Cite this

Approximating geodesics via random points. / Davis, Erik; Sethuraman, Sunder.

In: Annals of Applied Probability, Vol. 29, No. 3, 01.01.2019, p. 1446-1486.

Research output: Contribution to journalArticle

@article{c47605e5dd484b138820e57b0edec786,
title = "Approximating geodesics via random points",
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",
keywords = "Consistency, Distance, Finsler, Gamma convergence, Geodesic, Random geometric graph, Scaling limit, Shortest path",
author = "Erik Davis and Sunder Sethuraman",
year = "2019",
month = "1",
day = "1",
doi = "10.1214/18-AAP1414",
language = "English (US)",
volume = "29",
pages = "1446--1486",
journal = "Annals of Applied Probability",
issn = "1050-5164",
publisher = "Institute of Mathematical Statistics",
number = "3",

}

TY - JOUR

T1 - Approximating geodesics via random points

AU - Davis, Erik

AU - Sethuraman, Sunder

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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

AB - 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

KW - Consistency

KW - Distance

KW - Finsler

KW - Gamma convergence

KW - Geodesic

KW - Random geometric graph

KW - Scaling limit

KW - Shortest path

UR - http://www.scopus.com/inward/record.url?scp=85063357722&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85063357722&partnerID=8YFLogxK

U2 - 10.1214/18-AAP1414

DO - 10.1214/18-AAP1414

M3 - Article

VL - 29

SP - 1446

EP - 1486

JO - Annals of Applied Probability

JF - Annals of Applied Probability

SN - 1050-5164

IS - 3

ER -