Asymptotics of geometrical navigation on a random set of points in the plane
From MaRDI portal
Publication:3111049
DOI10.1239/aap/1324045692zbMath1238.60014arXiv1009.4679OpenAlexW1974342684MaRDI QIDQ3111049
Nicolas Bonichon, Jean-François Marckert
Publication date: 17 January 2012
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.4679
Analysis of algorithms (68W40) Geometric probability and stochastic geometry (60D05) Convergence of probability measures (60B10) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items (8)
Directed, cylindric and radial Brownian webs ⋮ Absence of percolation for Poisson outdegree-one graphs ⋮ Semi-Infinite Paths of the Two-Dimensional Radial Spanning Tree ⋮ The 2D‐directed spanning forest is almost surely a tree ⋮ Sublinearity of the number of semi-infinite branches for geometric random trees ⋮ Efficiently navigating a random Delaunay triangulation ⋮ Traffic flow densities in large transport networks ⋮ Nearest Neighbor Connectivity in Two-Dimensional Multihop MANETs
Cites Work
- Unnamed Item
- Unnamed Item
- Connected spatial networks over random points and a route-length statistic
- Random directed trees and forest -- drainage networks with dependence
- Navigation on a Poisson point process
- The radial spanning tree of a Poisson point process
- Two-dimensional Poisson trees converge to the Brownian web
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
- π/2-Angle Yao Graphs Are Spanners
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Foundations of Modern Probability
- On a random directed spanning tree
- Short-length routes in low-cost networks via Poisson line patterns
- On the total length of the random minimal directed spanning tree
This page was built for publication: Asymptotics of geometrical navigation on a random set of points in the plane
