The gbpTrees algorithm for building merger trees
- The gbpTrees algorithm is designed to minimize cascading merger tree inconsistencies (or pathologies) that arrise due to errors or ambiguities in the halo finding process.
- Matching is conducted using only radially sorted lists of particle IDs. Matches both forwards and backwards in time over a range of snapshots (for configuration-space halo finders: ideally ~16 separated over 2 dynamical times) used to correct for pathological cases.
- An implementation of the algorithm is available as part of gbpCode, which can be downloaded here.
- See the code paper or links to related papers given below for more details.
Selected Publications
Some highlighted publications involving gbpTrees:
This study presents the gbpTrees algorithm and uses it to condect a detailed convergence study of merger tree construction with a configuration space halo finder. Merger rates for friends-of-friends halos and substructures across nearly all observed galactic history are presented.
Click here to see the full paper on NASA ADS (if you do not have access to the journal, follow the arXiv link).