Navigation on a Poisson point process
From MaRDI portal
Abstract: On a locally finite point set, a navigation defines a path through the point set from one point to another. The set of paths leading to a given point defines a tree known as the navigation tree. In this article, we analyze the properties of the navigation tree when the point set is a Poisson point process on . We examine 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 where new results are established.
Recommendations
Cites work
- scientific article; zbMATH DE number 17688 (Why is no real title available?)
- scientific article; zbMATH DE number 2042286 (Why is no real title available?)
- scientific article; zbMATH DE number 1460450 (Why is no real title available?)
- scientific article; zbMATH DE number 747046 (Why is no real title available?)
- 1994 ACM symposium on Parallel algorithms and architectures, June 27--29, 1994, Cape May, NJ, USA
- A New Approach to the Limit Theory of Recurrent Markov Chains
- Asymptotics for first-passage times on Delaunay triangulations
- Convergence Rates in the Law of Large Numbers
- Convergence rates for probabilities of moderate deviations for sums of random variables with multidimensional indices
- Efficient routeing in Poisson small-world networks
- Geodesics and spanning trees for Euclidean first-passage percolation.
- Limit theory for random sequential packing and deposition
- Location-aided routing (LAR) in mobile ad hoc networks
- Markov chains and stochastic stability
- Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
- Navigation in small-world networks: a scale-free continuum model
- Navigation on a Poisson point process
- On the connectivity and diameter of small-world networks
- Poisson trees, succession lines and coalescing random walks
- Random minimal directed spanning trees and Dickman-type distributions
- Random oriented trees: a model of drainage networks.
- The central limit theorem for Euclidean minimal spanning trees. I
- The radial spanning tree of a Poisson point process
- The small-world phenomenon: an algorithmic perspective
- Weak laws of large numbers in geometric probability
Cited in
(11)- Optimal paths on the space-time SINR random graph
- Poissonian tree constructed from independent Poisson point processes
- Navigation in spatial networks: a survey
- Traffic flow densities in large transport networks
- The radial spanning tree of a Poisson point process
- Distribution of the smallest visited point in a greedy walk on the line
- Asymptotics of geometrical navigation on a random set of points in the plane
- Connected allocation to Poisson points in \(\mathbb R^{2}\)
- Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web
- Central limit theorems for the radial spanning tree
- Navigation on a Poisson point process
This page was built for publication: Navigation on a Poisson point process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2426610)