Navigation on a Poisson point process (Q2426610): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:20, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Navigation on a Poisson point process |
scientific article |
Statements
Navigation on a Poisson point process (English)
0 references
23 April 2008
0 references
Let \(N\) be a locally finite point set obtained by a Poisson point process in \(d\)-dimensional Euclidean space. A connected graph called the navigation tree is defined on \(N\) extended with origo. A greedy navigation algorithm is analyzed and asymptotic results on long paths are given. Small-world graphs illustrate the results.
0 references
random spanning trees
0 references
Poisson point process
0 references
local weak convergence
0 references
small-world phenomenon
0 references
stochastic geometry
0 references
