Minimal spanning trees, filaments and galaxy clustering

Abstract

A graph-theoretical technique for assessing intrinsic patterns in point data sets is described. A unique construction, the minimal spanning tree, can be associated with any point-data set, given all the interpoint separations. This construction enables the skeletal pattern of galaxy clustering to be singled out in quantitative fashion, and differs from other statistics applied to these data sets. This technique is applied to two- and three-dimensional distributions of galaxies, and also to comparable random samples and numerical simulations. The observed CfA and Zwicky (1961-1968) data exhibit characteristic distributions of edge-lengths in their minimal spanning trees which are distinct from those found in random samples. These statistics are also reevaluated after normalizing to account for the level of clustering in the samples.