On the total length of the random minimal directed spanning tree (Q5480003)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the total length of the random minimal directed spanning tree |
scientific article; zbMATH DE number 5042473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the total length of the random minimal directed spanning tree |
scientific article; zbMATH DE number 5042473 |
Statements
On the total length of the random minimal directed spanning tree (English)
0 references
25 July 2006
0 references
point process
0 references
nearest-neighbour graph
0 references
spanning tree
0 references
fixed-point equation
0 references
phase transition
0 references
0 references
0 references
0 references
0.8633907437324524
0 references
0.8612619042396545
0 references
0.8321208357810974
0 references
0.8242893218994141
0 references
0.8206774592399597
0 references
