Connected spatial networks over random points and a route-length statistic

DOI10.1214/10-STS335zbMath1329.60009arXiv1003.3700OpenAlexW3104975753MaRDI QIDQ906528

Julian Shun, David J. Aldous

Publication date: 22 January 2016

Published in: Statistical Science (Search for Journal in Brave)

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

zbMATH Keywords

geometric graphrandom graphspatial networkproximity graph

Mathematics Subject Classification ID

Inference from spatial processes (62M30) Geometric probability and stochastic geometry (60D05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (18)

Spatial Gibbs random graphs ⋮ Shortest path distance in Manhattan Poisson line Cox process ⋮ Interacting particle systems as stochastic social dynamics ⋮ On the distribution of typical shortest-path lengths in connected random geometric graphs ⋮ Intrinsic dimension identification via graph-theoretic methods ⋮ Asymptotic properties of Euclidean shortest-path trees in random geometric graphs ⋮ Bounds to the normal for proximity region graphs ⋮ Connectivity of Random Geometric Graphs Related to Minimal Spanning Forests ⋮ True scale-invariant random spatial networks ⋮ Emergence of hierarchy in cost-driven growth of spatial networks ⋮ Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions ⋮ The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study ⋮ Route lengths in invariant spatial tree networks ⋮ Phase transitions and percolation at criticality in enhanced random connection models ⋮ Asymptotics of geometrical navigation on a random set of points in the plane ⋮ A conversation with David J. Aldous ⋮ Parametric Modeling of Sparse Random Trees Using 3D Copulas ⋮ First Passage Percolation on Random Geometric Graphs and an Application to Shortest-Path Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Poisson matching
• The expected size of some graphs in computational geometry
• The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
• Asymptotics for Euclidean minimal spanning trees on random points
• On the spread-out limit for bond and continuum percolation
• On central limit theorems in geometrical probability
• Lectures on random Voronoi tessellations
• The central limit theorem for Euclidean minimal spanning trees. I
• Probability theory of classical Euclidean optimization problems
• Trees and matchings from point processes
• Percolation and minimal spanning trees
• The central limit theorem for weighted minimal spanning trees on random points
• Weak laws of large numbers in geometric probability
• Central limit theorems for some graphs in computational geometry.
• Normal approximation for some mean-value estimates of absolutely regular tessellations
• Hammersley's interacting particle process and longest increasing subsequences
• Concentration of measure and isoperimetric inequalities in product spaces
• Estimating the asymptotic constant of the total length of Euclidean minimal spanning trees with power-weighted edges.
• On the homogeneous planar Poisson point process
• Scale-invariant random spatial networks
• THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
• On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
• Geometric Spanner Networks
• Spatial transportation networks with transfer costs: asymptotic optimality of hub-and-spoke models
• On the expected maximum degree of Gabriel and Yao graphs
• The Structure and Function of Complex Networks
• Random Geometric Graphs
• Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
• On the History of the Minimum Spanning Tree Problem
• The central limit theorem for Euclidean minimal spanning trees II
• The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study
• Short-length routes in low-cost networks via Poisson line patterns

This page was built for publication: Connected spatial networks over random points and a route-length statistic