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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Major roads and span length in scale-invariant random spatial networks

Yitzchak Shmalo
Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
preprint

Major roads and span length in scale-invariant random spatial networks

Yitzchak Shmalo
preprint en

Abstract

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$.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon