Route Lengths in Invariant Spatial Tree Networks

preprint2021arXivOpen access

Abstract

Is there a constant r0r_0 such that, in any invariant tree network linking rate-11 Poisson points in the plane, the mean within-network distance between points at Euclidean distance rr is infinite for r>r0r > r_0? We prove a slightly weaker result. This is a continuum analog of a result of Benjamini et al (2001) on invariant spanning trees of the integer lattice.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.