Route lengths in invariant spatial tree networks

DOI10.1214/21-ECP401zbMath1479.05333arXiv2103.00669OpenAlexW3167952226MaRDI QIDQ2064832

David J. Aldous

Publication date: 6 January 2022

Published in: Electronic Communications in Probability (Search for Journal in Brave)

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

zbMATH Keywords

Poisson processspatial tree

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Connected spatial networks over random points and a route-length statistic
• Random partitions of the plane via Poissonian coloring and a self-similar process of coalescing planar partitions
• Morphogenesis of spatial networks
• Trees and matchings from point processes
• Uniform spanning forests
• Percolation and minimal spanning forests in infinite graphs
• Probability on Trees and Networks
• Continuum Percolation
• True scale-invariant random spatial networks
• Eternal Family Trees and dynamics on unimodular random graphs
• Unimodular random trees
• First Passage Percolation on Random Geometric Graphs and an Application to Shortest-Path Trees
• 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: Route lengths in invariant spatial tree networks