The distribution of node degree in maximum spanning trees
We use Monte Carlo simulation to study the distribution of node degree in the Euclidean maximum spanning tree. Extrapolating from our experiments, we conjecture that, for uniformly distributed data, the asymptotic low-data-density probability of node degree k is proportional to k(-2). This conjecture, if true, has implications for detecting outliers and testing random number generators.
maximum spanning tree monte carlo simulation outlier random number generation minimum spanning tree