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

Abstract

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.

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

Cited by in corpus (15)

• HOP: A New Group-Finding Algorithm for N-body Simulations
• Inter-cluster filaments in a $\Lambda$CDM Universe
• Searching for a trail of evidence in a maze
• On effects of resolution in dissipationless cosmological simulations
• Quantifying Cosmic Superstructures
• Testing the Randomness in the Sky-Distribution of Gamma-Ray Bursts
• Multiscale probability mapping: groups, clusters and an algorithmic search for filaments in SDSS
• The Pisces-Cetus Supercluster: a remarkable filament of galaxies in the 2dF Galaxy Redshift Survey and Sloan Digital Sky surveys
• Detection of Network Structure in the Las Campanas Redshift Survey
• Multivariate Approaches to Classification in Extragalactic Astronomy
• Cosmology and neutrino mass with the Minimum Spanning Tree
• Beyond two-point statistics: using the minimum spanning tree as a tool for cosmology
• Analysis of the Spatial Distribution of Galaxies by Multiscale Methods
• Report on Optimal Substructure Techniques for Stellar, Gas and Combined Samples
• A Maximum Parsimony analysis of the effect of the environment on the evolution of galaxies