The Superiority of the Minimal Spanning Tree in Percolation Analyses of Cosmological Datasets

Details The Superiority of the Minimal Spanning Tree in Percolation Analyses of Cosmological Datasets The Superiority of the Minimal Spanning Tree in Percolation Analyses of Cosmological Datasets

1996-05-29

arxiv.org/abs/astro-ph/9605179v1

Astronomy and Astrophysics

Astrophysics

7 pages, 4 figures included, uses mn.sty & epsf.sty. Accepted by MNRAS

Scientific paper

In this work we demonstrate the ability of the Minimal Spanning Tree to duplicate the information contained within a percolation analysis for a point dataset. We show how to construct the percolation properties from the Minimal Spanning Tree, 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) \propto k^n$, with $n = -2, -1, 0 \ \& +1$) in a critical density universe. We find in general 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.

Affiliated with

Also associated with

No associations

Rating

The Superiority of the Minimal Spanning Tree in Percolation Analyses of Cosmological Datasets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Superiority of the Minimal Spanning Tree in Percolation Analyses of Cosmological Datasets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Superiority of the Minimal Spanning Tree in Percolation Analyses of Cosmological Datasets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602595