Related papers: Climbing Halo Merger Trees with TreeFrog
Retrieval Augmented Generation (RAG) is an essential agent for Large Language Model (LLM) aided Description Language (HDL) tasks, addressing the challenges of limited training data and prohibitively long prompts. However, its performance in…
We measure the 3PCF of 300 halo catalogs from the Minerva simulations covering a total volume of $~1000 h^{-3} \mathrm{Gpc}^3$. Each 3PCF measurement includes all possible triangular configurations with sides between 20 and…
The rate of merging of dark-matter halos is an absolutely essential ingredient for studies of both structure and galaxy formation. Remarkably, however, our quantitative understanding of the halo merger rate is still quite limited, and…
Galaxies are believed to be in one-to-one correspondence with simulated dark matter subhalos. We use high-resolution N-body simulations of cosmological volumes to calculate the statistical properties of subhalo (galaxy) major mergers at…
Retrieval-augmented generation (RAG) systems face significant challenges in multi-hop question answering (MHQA), where complex queries require synthesizing information across multiple document chunks. Existing approaches typically rely on…
Hierarchical structure formation theory is based on the notion that mergers drive galaxy evolution, so a considerable framework of semi-analytic models and N-body simulations has been constructed to calculate how mergers transform a growing…
We explore the interrelationships between the galaxy group halo mass and various observable group properties. We propose a simple scenario that describes the evolution of the central galaxies and their host dark matter halos. Star formation…
Meeting both scalability and performance portability requirements is a challenge for any HPC application, especially for adaptively refined ones. In Octo-Tiger, an astrophysics application for the simulation of stellar mergers, we approach…
[abridged] We present a detailed comparison of fundamental dark matter halo properties retrieved by a substantial number of different halo finders. These codes span a wide range of techniques including friends-of-friends (FOF),…
SPHINCS+ is a stateless hash-based signature scheme that provides strong post quantum security, but its signature generation is slow due to intensive hash computations. GPUs offer massive parallelism that can potentially accelerate SPHINCS+…
Recent work has proven the existence of extreme inbreeding in a European ancestry sample taken from the contemporary UK population \cite{nature_01}. This result brings our attention again to a math problem related to inbreeding family trees…
We present a detailed description and validation of our massively-parallel update to the mass-Peak Patch method, a fully predictive initial-space algorithm to quickly generate dark matter halo catalogues in very large cosmological volumes.…
Balanced search trees are widely used in computer science to efficiently maintain dynamic ordered data. To support efficient set operations (e.g., union, intersection, difference) using trees, the join-based framework is widely studied.…
We model the acquisition of spin by dark-matter halos in semi-analytic merger trees. We explore two different algorithms; one in which halo spin is acquired from the orbital angular momentum of merging satellites, and another in which halo…
The effects of merging histories of proto-objects on the angular momentum distributions of the present-time dark matter haloes are analysed. An analytical approach to the analysis of the angular momentum distributions assumes that the…
We present a new approach to study galaxy evolution in a cosmological context. We combine cosmological merger trees and semi-analytic models of galaxy formation to provide the initial conditions for multi-merger hydrodynamic simulations. In…
We present a new self-consistent semi-analytic model of the first stars and galaxies to explore the high-redshift ($z{>}15$) Population III (PopIII) and metal-enriched star formation histories. Our model includes the detailed merger history…
This paper investigates the execution of tree-shaped task graphs using multiple processors. Each edge of such a tree represents a large IO file. A task can only be executed if all input and output files fit into memory, and a file can only…
We describe a new Python-based stand-alone halo finding algorithm, Haskap Pie, that combines several methods of halo finding and tracking into a single calculation. Our halo-finder flexibly solves halos for simulations produced by eight…
The use of Euler-Lagrange methods on unstructured grids extends their application area to more versatile setups. However, the lack of a regular topology limits the scalability of distributed parallel methods, especially for routines that…