Related papers: Climbing Halo Merger Trees with TreeFrog
MPI-Rockstar is a massively parallel halo finder based on the Rockstar phase-space temporal halo finder code, which is one of the most extensively used halo finding codes. Compared to the original code, parallelized by a primitive socket…
This paper studies the hierarchical clustering problem, where the goal is to produce a dendrogram that represents clusters at varying scales of a data set. We propose the ParChain framework for designing parallel hierarchical agglomerative…
Finite-horizon lookahead policies are abundantly used in Reinforcement Learning and demonstrate impressive empirical success. Usually, the lookahead policies are implemented with specific planning methods such as Monte Carlo Tree Search…
The hierarchical growth of dark matter haloes, in which galaxies are hosted, has been studied and modeled using various approaches. In this paper we use a modified version the Sheth & Lemson algorithm for a $\mathrm{\Lambda}$ cold dark…
Reconciling a gene tree with a species tree is an important task that reveals much about the evolution of genes, genomes, and species, as well as about the molecular function of genes. A wide array of computational tools have been devised…
The last improvements in programming languages, programming models, and frameworks have focused on abstracting the users from many programming issues. Among others, recent programming frameworks include simpler syntax, automatic memory…
We use semi-analytic models and cosmological merger trees to provide the initial conditions for multi-merger numerical hydrodynamic simulations, and exploit these simulations to explore the effect of galaxy interaction and merging on star…
Dark matter haloes grow at a rate that depends on the value of the cosmological parameters $\sigma_8$ and $\Omega_{\rm m}$ through the initial power spectrum and the linear growth factor. While halo abundance is routinely used to constrain…
We have developed a new semi-analytic model for the formation and evolution of structure on galaxy, group and cluster scales. The model combines merger trees with a detailed, spatially resolved description of the dynamical evolution of halo…
There are multiple factors which can cause the phylogenetic inference process to produce two or more conflicting hypotheses of the evolutionary history of a set X of biological entities. That is: phylogenetic trees with the same set of leaf…
Subject of this paper is a detailed analysis of the PINOCCHIO algorithm for studying the relative velocity statistics of merging haloes in Lagrangian perturbation theory. Given a cosmological background model, a power spectrum of…
We present jFoF, a fully GPU-native Friends-of-Friends (FoF) halo finder designed for both high-performance simulation analysis and differentiable modeling. Implemented in JAX, jFoF achieves end-to-end acceleration by performing all…
This paper explores the mapping between the observable properties of a stellar halo in phase- and abundance-space and the parent galaxy's accretion history in terms of the characteristic epoch of accretion and mass and orbits of progenitor…
We investigate seven Monte Carlo algorithms -- four old and three new -- for constructing merger histories of dark matter halos using the extended Press-Schechter (EPS) formalism based on both the spherical and ellipsoidal collapse models.…
Monte Carlo Tree Search (MCTS) methods have achieved great success in many Artificial Intelligence (AI) benchmarks. The in-tree operations become a critical performance bottleneck in realizing parallel MCTS on CPUs. In this work, we develop…
The amount of completely sequenced chloroplast genomes increases rapidly every day, leading to the possibility to build large-scale phylogenetic trees of plant species. Considering a subset of close plant species defined according to their…
We present the public data release of halo and galaxy catalogues extracted from the EAGLE suite of cosmological hydrodynamical simulations of galaxy formation. These simulations were performed with an enhanced version of the GADGET code…
We present a new algorithm which groups the subhaloes found in cosmological N- body simulations by structure finders such as SUBFIND into dark matter haloes whose formation histories are strictly hierarchical. One advantage of these…
There is increasing interest in using multicore processors to accelerate stream processing. For example, indexing sliding window content to enhance the performance of streaming queries is greatly improved by utilizing the computational…
We have developed a Python package ZMCintegral for multi-dimensional Monte Carlo integration on multiple Graphics Processing Units(GPUs). The package employs a stratified sampling and heuristic tree search algorithm. We have built three…