Title:	Minimal spanning trees, filaments and galaxy clustering
Authors:	Barrow, J.D. Bhavsar, S.P. Sonoda, D.H.
Keywords:	COMPUTATIONAL ASTROPHYSICS, GALACTIC CLUSTERS, GRAPH THEORY, FILAMENTS, PATTERN RECOGNITION, RANDOM SAMPLING STATISTICAL DISTRIBUTIONS
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:	Open Access
URI:	http://hdl.handle.net/2289/1552
ISSN:	0035-8711
Alternative Location:	http://adsabs.harvard.edu/cgi-bin/bib_query? 1985MNRAS.216...17B http://adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1985MNRAS.216...17B&link_type=ARTICLE&db_key=AST
Copyright:	(1985) Royal Astronomical Society
Appears in Collections:	Research Papers (A&A)

Items in RRI Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.