Related papers: Climbing Halo Merger Trees with TreeFrog
We describe a new implementation of a parallel Tree-SPH code with the aim to simulate Galaxy Formation and Evolution. The code has been parallelized using SHMEM, a Cray proprietary library to handle communications between the 256 processors…
A common approach in semi-analytic modeling of galaxy formation is to construct Monte Carlo realizations of merger histories of dark matter halos whose masses are sampled from a halo mass function. Both the mass function itself, and the…
Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization and scientific computing. While a greedy algorithm exists…
We introduce the contour process to describe the geometrical properties of merger trees. The contour process produces a one-dimensional object, the contour walk, which is a translation of the merger tree. We portray the contour walk through…
We present a new parallel implementation of the PINpointing Orbit Crossing-Collapsed HIerarchical Objects (PINOCCHIO) algorithm, a quick tool, based on Lagrangian Perturbation Theory, for the hierarchical build-up of Dark Matter halos in…
This paper presents a new algorithm for the fast, shared memory, multi-core computation of augmented contour trees on triangulations. In contrast to most existing parallel algorithms our technique computes augmented trees, enabling the full…
Merkle trees have become a widely successful cryptographic data structure. Enabling a vast variety of applications from checking for inconsistencies in databases like Dynamo to essential tools like Git to large scale distributed systems…
Dark matter halo demographics and assembly histories are a manifestation of cosmological structure formation and have profound implications for the formation and evolution of galaxies. In particular, merger trees provide fundamental input…
The effects of spatial correlations of density fluctuations on merger histories of dark matter haloes (so-called `{\it merger trees}') are analysed. We compare the mass functions of dark haloes derived by a new method for calculating merger…
Retrieval-augmented generation (RAG) enhances large language models with external knowledge, and tree-based RAG organizes documents into hierarchical indexes to support queries at multiple granularities. However, existing Tree-RAG methods…
This paper presents a study of the specific merger rate as a function of group membership, local environment, and redshift in a very large, $500h^{-1} Mpc$, cosmological N-body simulation, the \textit{Millennium Simulation}. The goal is to…
We present a comparison of 14 galaxy formation models: 12 different semi-analytical models and 2 halo-occupation distribution models for galaxy formation based upon the same cosmological simulation and merger tree information derived from…
The dynamical state and morphological features of galaxies and galaxy clusters, and their high-redshift precursors, are tightly connected with their assembly history, encoding crucial information about the formation and evolution of such…
Determining the interaction partners among protein/domain families poses hard computational problems, in particular in the presence of paralogous proteins. Available approaches aim to identify interaction partners among protein/domain…
We describe a methodology to accurately compute halo mass functions, progenitor mass functions, merger rates and merger trees in non-cold dark matter universes using a self-consistent treatment of the generalized extended Press-Schechter…
Dark matter halo merger trees are now routinely extracted from cosmological simulations of structure formation. These trees are frequently used as inputs to semi-analytic models of galaxy formation to provide the backbone within which…
We describe a simple and fast algorithm for identifying friends-of-friends features and prove its correctness. The algorithm avoids unnecessary expensive neighbor queries, uses minimal memory overhead, and rejects slowdown in high…
Retrieval-Augmented Generation (RAG) grounds large language models in external evidence, yet it still falters when answers must be pieced together across semantically distant documents. We close this gap with the Hierarchical Lexical Graph…
We study the impact of merging routines in merge-based sorting algorithms. More precisely, we focus on the galloping routine that TimSort uses to merge monotonic sub-arrays, hereafter called runs, and on the impact on the number of element…
OCTO-TIGER is an astrophysics code to simulate the evolution of self-gravitating and rotat-ing systems of arbitrary geometry based on the fast multipole method, using adaptive mesh refinement. OCTO-TIGER is currently optimised to simulate…