๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A test of randomness based on the minimal spanning tree

โœ Scribed by Richard Hoffman; Anil K Jain

Book ID
107919703
Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
381 KB
Volume
1
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Random minimal spanning tree and percola
Random minimal spanning tree and percolation on the N-cube
โœ Mathew D. Penrose ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 251 KB ๐Ÿ‘ 1 views

The N-cube is a graph with 2 N vertices and N 2 Ny1 edges. Suppose indepen- dent uniform random edge weights are assigned and let T be the spanning tree of minimal ลฝ . y 1 N ฯฑ y3 total weight. Then the weight of T is asymptotic to N 2 ร i as N ยช ฯฑ. Asymp-is1 totics are also given for the local stru

Inapplicability of Asymptotic Results on
Inapplicability of Asymptotic Results on the Minimal Spanning Tree in Statistical Testing
โœ C. Caroni; P. Prescott ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 62 KB

Penrose has given asymptotic results for the distribution of the longest edge of the minimal spanning tree and nearest neighbour graph for sets of multivariate uniformly or normally distributed points. We investigate the applicability of these results to samples of up to 100 points, in up to 10 dime

Tail bound for the minimal spanning tree
Tail bound for the minimal spanning tree of a complete graph
โœ Jeong Han Kim; Sungchul Lee ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB

Suppose each edge of the complete graph K n is assigned a random weight chosen independently and uniformly from the unit interval [0; 1]. A minimal spanning tree is a spanning tree of K n with the minimum weight. It is easy to show that such a tree is unique almost surely. This paper concerns the nu