Major roads and span length in scale-invariant random spatial networks
We study two of Aldous's open problems on scale-invariant random spatial networks. For his binary hierarchy model we show that almost surely the set of major roads contains every road line above a fixed height. These lines form a connected grid, so the major roads have exactly one unbounded connected component, which answers Open Problem 7 of Aldous for this model. Open Problem 9 asks under what extra assumptions the subnetwork spanning $k$ uniform points in a square of area $k$ has expected length asymptotic to $\ell k$. We show, in every such network, that this holds exactly when the part of the span far from the square has expected length $o(k)$, and that it holds when the expected length of one route outside the disc of radius $t$ about an endpoint is $o(t^{-3})$. The condition is met in the binary hierarchy model, with no extra assumption, and in the planar Poisson line network when its speed exponent exceeds $5$.
Authors
- Yitzchak Shmalo (ORCID: https://orcid.org/0000-0002-2886-3049)
Institutions
- Hebrew University of Jerusalem (IL)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-15
- DOI
- https://doi.org/10.5281/zenodo.24238906
- Primary Topic
- Stochastic processes and statistical mechanics
- Type
- preprint