On the value of a random minimum spanning tree problem (Q1066149)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3924796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the value of a random minimum spanning tree problem |
scientific article; zbMATH DE number 3924796 |
Statements
On the value of a random minimum spanning tree problem (English)
0 references
1985
0 references
The lengths of the edges in a complete graph of order n are independent identically distributed random variables. Under mild conditions the length of the minimum spanning tree is shown to converge in probability as \(n\to \infty\), and the limiting value of the expected length is determined.
0 references
edge length
0 references
complete graph
0 references
minimum spanning tree
0 references
0.938160240650177
0 references
0.9178539514541626
0 references
0.9041732549667358
0 references
