TY - JOUR

T1 - Studies of galaxy clustering through the use of binary tree hierarchies. I. Multipoint correlation functions

AU - Ruffa, Gregory J.

AU - Porter, David H.

PY - 1993/1/1

Y1 - 1993/1/1

N2 - A method is presented for the evaluation of multipoint correlation functions employing the analysis of the structure of a "binary tree" which spans the particular set of galaxies under consideration. A recursive center-of-mass transformation is used and a binary tree data structure is compiled. For a large number of particles, N, the computational expense for constructing the tree increases as N log N. In a similar way, the m-point correlation functions are also determined by recursively scanning the nodes of the tree and binning the m-tuplets discovered by the scan. It thus becomes possible to obtain the same N log N functional form for computational expense for general m-point correlation functions versus a cost function of order Nm by the direct counting of m-tuplets. Moreover, it is found that the scanning processes are accelerated if the galaxy set of interest possesses any sort of clustering. If the limits of the counting bins are also relaxed, still further increases in speed are achieved, with little loss of precision in the determination of the correlation functions. A variety of artificial data sets and observed galaxy catalogs have been examined with this approach. Gains of more than two orders of magnitude in computational speed are attained over that possible by direct counting of m-tuplets. This permits the examination of much larger data sets or of higher-order correlations than has been possible thus far. The details of this technique are described here, with the statistical results from these studies to be presented in a subsequent paper.

AB - A method is presented for the evaluation of multipoint correlation functions employing the analysis of the structure of a "binary tree" which spans the particular set of galaxies under consideration. A recursive center-of-mass transformation is used and a binary tree data structure is compiled. For a large number of particles, N, the computational expense for constructing the tree increases as N log N. In a similar way, the m-point correlation functions are also determined by recursively scanning the nodes of the tree and binning the m-tuplets discovered by the scan. It thus becomes possible to obtain the same N log N functional form for computational expense for general m-point correlation functions versus a cost function of order Nm by the direct counting of m-tuplets. Moreover, it is found that the scanning processes are accelerated if the galaxy set of interest possesses any sort of clustering. If the limits of the counting bins are also relaxed, still further increases in speed are achieved, with little loss of precision in the determination of the correlation functions. A variety of artificial data sets and observed galaxy catalogs have been examined with this approach. Gains of more than two orders of magnitude in computational speed are attained over that possible by direct counting of m-tuplets. This permits the examination of much larger data sets or of higher-order correlations than has been possible thus far. The details of this technique are described here, with the statistical results from these studies to be presented in a subsequent paper.

KW - Galaxies: clustering

KW - Methods: numerical

UR - http://www.scopus.com/inward/record.url?scp=4243833121&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4243833121&partnerID=8YFLogxK

U2 - 10.1086/191801

DO - 10.1086/191801

M3 - Article

AN - SCOPUS:4243833121

VL - 87

SP - 179

EP - 195

JO - Astrophysical Journal, Supplement Series

JF - Astrophysical Journal, Supplement Series

SN - 0067-0049

IS - 1

ER -