Random minimal trees
随机最小树
Random minimal trees in both 2 and 3 dimensions are discussed. The expected total length of the minimal trees connecting n points uniformly distributed in an area A, and in a volume F, are asymptotic to a2(An)12,a2(Vn)12 respectively, where a, and a, are constants. Upper and lower bounds are obtained on these constants and their values estimated by a Monte Carlo technique.