REVIEW 1 cited by
Climbing Halo Merger Trees with TreeFrog
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We present TreeFrog, a massively parallel halo merger tree builder that is capable comparing different halo catalogues and producing halo merger trees. The code is written in c++11, use the MPI and OpenMP API's for parallelisation, and includes python tools to read/manipulate the data products produced. The code correlates binding energy sorted particle ID lists between halo catalogues, determining optimal descendant/progenitor matches using multiple snapshots, a merit function that maximises the number of shared particles using pseudo-radial moments, and a scheme for correcting halo merger tree pathologies. Focusing on VELOCIraptor catalogues for this work, we demonstrate how searching multiple snapshots spanning a dynamical time significantly reduces the number of stranded halos, those lacking a descendant or a progenitor, critically correcting poorly resolved halos. We present a new merit function that improves the distinction between primary and secondary progenitors, reducing tree pathologies. We find FOF accretion rates and merger rates show similar mass ratio dependence. The model merger rates from Poole et al, (2017) agree with the measured net growth of halos through mergers.
Forward citations
Cited by 1 Pith paper
-
From Stellar Halos to Intracluster Light: the physics of the Intra-Halo Stellar Component in cosmological hydrodynamical simulations
A new adaptive phase-space definition of diffuse stellar material in simulations shows the intra-halo stellar mass fraction rises with system mass and is most strongly anti-correlated with the central galaxy's V/sigma...
Discussion (0). Continue with ORCID to comment.