Biometrika 1968 55(1):255-258; doi:10.1093/biomet/55.1.255
© 1968 by Biometrika Trust
Random minimal trees
F.D.K. ROBERTS
University OF Liverpool
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
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.

CiteULike
Connotea
Del.icio.us What's this?
Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our
Customer Services Department.