The superiority of the minimal spanning tree in percolation analyses of cosmological data sets
Abstract
In this work we demonstrate the ability of the minimal spanning tree (MST) to duplicate the information contained within a percolation analysis for a point data set. We show how to construct the percolation properties from the MST, finding roughly an order of magnitude improvement in the computer time required. We apply these statistics to particlemesh simulations of largescale structure formation. We consider purely scalefree Gaussian initial conditions [P(k)~k^n, with n=2, 1, 0 and +1] in a criticaldensity universe. We find, in general, that the mass of the percolating cluster is a much better quantity by which to judge the onset of percolation than the length of the percolating cluster.
 Publication:

Monthly Notices of the Royal Astronomical Society
 Pub Date:
 October 1996
 DOI:
 10.1093/mnras/282.4.1461
 arXiv:
 arXiv:astroph/9605179
 Bibcode:
 1996MNRAS.282.1461B
 Keywords:

 METHODS: DATA ANALYSIS;
 COSMOLOGY: MISCELLANEOUS;
 LARGESCALE STRUCTURE OF UNIVERSE;
 Astrophysics
 EPrint:
 7 pages, 4 figures included, uses mn.sty &