Papers
Topics
Authors
Recent
Search
2000 character limit reached

CTree: Branch-wise compatible merger tree builder

Published 8 Sep 2026 in astro-ph.IM and astro-ph.CO | (2609.08086v1)

Abstract: We introduce a merger tree builder, CTree. Its key feature is the identification of progenitors using the evolutionary information encoded in object branches, rather than relying solely on the instantaneous particle membership in a single snapshot. In this sense, CTree can be described as a branch-wise merger tree builder. Specifically, CTree extracts particles associated with objects over a defined timescale and uses this information to compute the merit functions employed in the progenitor search across multiple snapshots. During this process, CTree requires only the identifiers of particles and objects. This ensures high compatibility with different halo and galaxy catalogues and also with pre-existing merger trees. To identify `core' particles that remain bound to the host halo over extended physical timescales, CTree employs a simple and efficient algorithm that does not rely on explicit radial or binding-energy information. The timescale adopted for core particle extraction and the number of snapshots used in the progenitor search can be user-configured. Basic validation tests using suites of dark matter-only simulations demonstrate that CTree produces stable and physically consistent halo merger trees, particularly in high-density regions or in simulations with high output cadence. The code is written in C++ and employs a hybrid message passing interface and OpenMP parallelization, making it well-suited for high-resolution cosmological simulations. The code is publicly available and actively maintained to improve performance, reliability, and compatibility.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.