The length of the network spanning k random points in the Poisson line SIRSN

Place k independent uniform points in a square of area k and join every pair by its route in a scale-invariant random spatial network. Aldous asked for a proof that the expected total length of the union of these routes is asymptotic to ℓk, where ℓ is the mean length per unit area of the network on a unit-rate Poisson process. We prove this for the network of geodesics of the planar improper Poisson line process whose line speeds have a power-law intensity with exponent γ > 2. The lower bound holds for every scale-invariant random spatial network. For the upper bound we show that all geodesics between points of the unit square lie in the disc of radius R about its centre outside an event of probability O(R^(−a)), for every 0 < a < γ − 1. Since γ − 1 > 1, this and a moment bound of Kahn show that for each δ > 0 the expected length of the union at distance more than δ√k from the square is O(√k).

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24273127
Primary Topic
Point processes and geometric inequalities
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The length of the network spanning k random points in the Poisson line SIRSN

Yitzchak Shmalo
2 links
Zenodo (CERN European Organization for Nuclear Research)
Point processes and geometric inequalities
preprint

The length of the network spanning k random points in the Poisson line SIRSN

Yitzchak Shmalo
preprint en

Abstract

Place k independent uniform points in a square of area k and join every pair by its route in a scale-invariant random spatial network. Aldous asked for a proof that the expected total length of the union of these routes is asymptotic to ℓk, where ℓ is the mean length per unit area of the network on a unit-rate Poisson process. We prove this for the network of geodesics of the planar improper Poisson line process whose line speeds have a power-law intensity with exponent γ > 2. The lower bound holds for every scale-invariant random spatial network. For the upper bound we show that all geodesics between points of the unit square lie in the disc of radius R about its centre outside an event of probability O(R^(−a)), for every 0 < a < γ − 1. Since γ − 1 > 1, this and a moment bound of Kahn show that for each δ > 0 the expected length of the union at distance more than δ√k from the square is O(√k).

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Point processes and geometric inequalities
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