Minimal spanning trees, filaments and galaxy clustering

Details Minimal spanning trees, filaments and galaxy clustering Minimal spanning trees, filaments and galaxy clustering

Sep 1985

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1985mnras.216...17b&link_type=abstract

Monthly Notices of the Royal Astronomical Society (ISSN 0035-8711), vol. 216, Sept. 1, 1985, p. 17-35.

Statistics

Computation

129

Computational Astrophysics, Galactic Clusters, Graph Theory, Filaments, Pattern Recognition, Random Sampling, Statistical Distributions

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Minimal spanning trees, filaments and galaxy clustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimal spanning trees, filaments and galaxy clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimal spanning trees, filaments and galaxy clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-801830