Related papers: Sussing Merger Trees: A proposed Merger Tree data …
Merger trees track the evolution of halos across multiple snapshots. They assign for halos of a particular snapshot, the set of halos from previous snapshots they possibly originated from. In this work, Association rule analysis a well…
Scalar field comparison is a fundamental task in scientific visualization. In topological data analysis, we compare topological descriptors of scalar fields -- such as persistence diagrams and merge trees -- because they provide succinct…
We present TreeFrog, a massively parallel halo merger tree builder that is capable comparing different halo catalogues and producing halo merger trees. The code is written in c++11, use the MPI and OpenMP API's for parallelisation, and…
We construct merger trees from the largest database of dark matter haloes to date provided by the Millennium simulation to quantify the merger rates of haloes over a broad range of descendant halo mass (1e12 < M0 < 1e15 Msun), progenitor…
A halo merger tree forms the essential backbone of a semi-analytic model for galaxy formation and evolution. Recent studies have pointed out that extracting merger trees from numerical simulations of structure formation is non-trivial;…
We present an algorithm to extend subhalo merger trees in a low-resolution dark-matter-only simulation by conditionally matching them to those in a high-resolution simulation. The algorithm is general and can be applied to simulation data…
In the $\Lambda$CDM universe, structure formation is generally not a self-similar process, while some self-similarity remains in certain statistics which can greatly simplify our description and understanding of the cosmic structures. In…
Although a fair amount of work has been devoted to growing Monte-Carlo merger trees which resemble those built from an N-body simulation, comparatively little effort has been invested in quantifying the caveats one necessarily encounters…
Semi-analytic models are best suited to compare galaxy formation and evolution theories with observations. These models rely heavily on halo merger trees, and their realistic features (i.e., no drastic changes on halo mass or jumps on…
We present a simple and efficient empirical algorithm for constructing dark-matter halo merger trees that reproduce the distribution of trees in the Millennium cosmological $N$-body simulation. The generated trees are significantly better…
Applications in many domains are based on a series of traversals of tree structures, and fusing these traversals together to reduce the total number of passes over the tree is a common, important optimization technique. In applications such…
We model the formation and evolution of galaxy clusters in the framework of an extended dark matter halo merger-tree algorithm that includes baryons and incorporates basic physical considerations. Our modified treatment is employed to…
Structure identification in cosmological simulations plays an important role in analysing simulation outputs. The definition of these structures directly impacts the inferred properties derived from these simulations. This paper proposes a…
Cosmological N-body simulations rank among the most computationally intensive efforts today. A key challenge is the analysis of structure, substructure, and the merger history for many billions of compact particle clusters, called halos.…
Algorithms for deriving Huffman codes and the recently developed algorithm for compiling PIFO trees to trees of fixed shape (Mohan et al. 2022) are similar, but work with different underlying algebraic operations. In this paper, we exploit…
We present a new algorithm for generating merger trees and halo catalogs which explicitly ensures consistency of halo properties (mass, position, and velocity) across timesteps. Our algorithm has demonstrated the ability to improve both the…
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…
This paper introduces the Cartesian Merkle Tree, a deterministic data structure that combines the properties of a Binary Search Tree, a Heap, and a Merkle tree. The Cartesian Merkle Tree supports insertions, updates, and removals of…
We describe a new methodology to analyze the reionization process in numerical simulations: the chronology and the geometry of reionization is investigated by means of merger histories of individual HII regions. From the merger tree of…
This article concerns the formation and structure of dark matter halos, including (1) their radial density profiles, (2) their abundance, and (3) their merger rates. The last topic may be relevant to the nature of the small, bright,…