Random minimal spanning tree and percola
โ
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