Navigation on a Poisson point process - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Navigation on a Poisson point process

Charles Bordenave


On a locally finite point set, a navigation defines a path through the point set from a point to an other. The set of paths leading to a given point defines a tree, the navigation tree. In this article, we analyze the properties of the navigation tree when the point set is a Poisson point process on $R^d$. We examine the distribution of stable functionals, the local weak convergence of the navigation tree, the asymptotic average of a functional along a path, the shape of the navigation tree and its topological ends. We illustrate our work in the small world graphs, and new results are established. This work is motivated by applications in computational geometry and in self-organizing networks.
Fichier principal
Vignette du fichier
RR-5790.pdf (625.65 Ko) Télécharger le fichier

Dates and versions

inria-00070231 , version 1 (19-05-2006)


  • HAL Id : inria-00070231 , version 1


Charles Bordenave. Navigation on a Poisson point process. [Research Report] RR-5790, INRIA. 2006, pp.76. ⟨inria-00070231⟩
87 View
91 Download


Gmail Facebook Twitter LinkedIn More