The invariance principle for the total length of the nearest-neighbor graph (Q2576795): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:40, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The invariance principle for the total length of the nearest-neighbor graph |
scientific article |
Statements
The invariance principle for the total length of the nearest-neighbor graph (English)
0 references
14 December 2005
0 references
The authors show a strong invariance principle for the total length of the nearest-neighbour graph on \({\mathcal P}\cap[-n/2,n/2]^d\), where \(d\in\{2,3,\dots\}\) and \({\mathcal P}\) denotes a Poisson point process on \({\mathbb R}^d\) with intensity \(1\).
0 references
geometric probability
0 references
Poisson point process
0 references
