RRI Digital Repository >
04. Astronomy and Astrophysics >
Research Papers (A&A) >
Please use this identifier to cite or link to this item:
|Title: ||Minimal spanning trees, filaments and galaxy clustering|
|Authors: ||Barrow, J.D.|
|Keywords: ||COMPUTATIONAL ASTROPHYSICS,|
|Issue Date: ||1985 |
|Publisher: ||Blackwell Publishing for the Royal Astronomical Society|
|Citation: ||Monthly Notices of the Royal Astronomical Society, 1985, Vol.216, p17-35|
|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.|
|Description: ||Sorry, the full text of this article is not available here. Please click on the alternative location to access it.|
|Alternative Location: ||http://adsabs.harvard.edu/cgi-bin/bib_query?
|Copyright: ||(1985) Royal Astronomical Society|
|Appears in Collections:||Research Papers (A&A)|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.