The superiority of the minimal spanning tree in percolation analyses of cosmological data sets

38Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

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 particle-mesh simulations of large-scale structure formation. We consider purely scale-free Gaussian initial conditions [P(k) ∝kn with n= -2, - 1, 0 and + 1] in a critical-density 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.

Cite

CITATION STYLE

APA

Bhavsar, S. P., & Splinter, R. J. (1996). The superiority of the minimal spanning tree in percolation analyses of cosmological data sets. Monthly Notices of the Royal Astronomical Society, 282(4), 1461–1466. https://doi.org/10.1093/mnras/282.4.1461

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free