Short-length routes in low-cost networks via Poisson line patterns

DOI10.1239/aap/1208358883zbMath1167.60004arXivmath/0701140OpenAlexW2130731265MaRDI QIDQ5387074

Wilfrid S. Kendall, David J. Aldous

Publication date: 15 May 2008

Published in: Advances in Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

probabilistic methodSteiner treetotal variation distancespatial networkPoisson line processmark distributionSlivynak theoremratio statisticVasershtein couplingexcess statisticBuffon argument

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10)

Related Items

Improper Poisson line process as SIRSN in any dimension ⋮ Continuity results and estimates for the Lyapunov exponent of Brownian motion in stationary potential ⋮ Spatial Gibbs random graphs ⋮ Connected spatial networks over random points and a route-length statistic ⋮ Geodesics and flows in a Poissonian city ⋮ The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study ⋮ Scaling limits for shortest path lengths along the edges of stationary tessellations ⋮ Route lengths in invariant spatial tree networks ⋮ Shape theorem and surface fluctuation for Poisson cylinders ⋮ Phase transitions and percolation at criticality in enhanced random connection models ⋮ Asymptotics of geometrical navigation on a random set of points in the plane ⋮ Return to the Poissonian city ⋮ A conversation with David J. Aldous ⋮ Average stretch factor: how low does it go? ⋮ First Passage Percolation on Random Geometric Graphs and an Application to Shortest-Path Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Proof of David Kendall's conjecture concerning the shape of large random polygons
• Probability theory of classical Euclidean optimization problems
• A simplified proof of a conjecture of D. G. Kendall concerning shapes of random polygons
• Conformal invariance of planar loop-erased random walks and uniform spanning trees.
• The limit shape of the zero cell in a stationary Poisson hyperplane tessellation.
• A heuristic proof of a long-standing conjecture of D. G. Kendall concerning the shapes of certain large random polygons