The radial spanning tree of a Poisson point process

Abstract

We analyze a class of spatial random spanning trees built on a realization of a homogeneous Poisson point process of the plane. This tree has a simple radial structure with the origin as its root. We first use stochastic geometry arguments to analyze local functionals of the random tree such as the distribution of the length of the edges or the mean degree of the vertices. Far away from the origin, these local properties are shown to be close to those of a variant of the directed spanning tree introduced by Bhatt and Roy. We then use the theory of continuous state space Markov chains to analyze some nonlocal properties of the tree, such as the shape and structure of its semi-infinite paths or the shape of the set of its vertices less than $k$ generations away from the origin. This class of spanning trees has applications in many fields and, in particular, in communications.

Published at http://dx.doi.org/10.1214/105051606000000826 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (5)

• The Brownian web: Characterization and convergence
• Two-dimensional Poisson Trees converge to the Brownian web
• Navigation on a Poisson point process
• Random oriented Trees: a Model of drainage networks
• On the total length of the random minimal directed spanning tree

Cited by in corpus (7)

• The 2d-Directed Spanning Forest is almost surely a tree
• Semi-infinite paths of the 2d-Radial Spanning Tree
• Navigation on a Poisson point process
• Optimal Paths on the Space-Time SINR Random Graph
• Limit theorems for random spatial drainage networks
• Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web
• Large and moderate deviations in Poisson navigations