Related papers: The Coarse Geometry of Merger Trees in \Lambda CDM
We present a new Monte-Carlo algorithm to generate merger trees describing the formation history of dark matter halos. The algorithm is a modification of the algorithm of Cole et al (2000) used in the GALFORM semi-analytic galaxy formation…
Merger trees harvested from cosmological $N$-body simulations encode the assembly histories of dark matter halos over cosmic time, and are a fundamental component of semi-analytical models (SAMs) of galaxy formation. The ability to compare…
Merger trees follow the growth and merger of dark-matter haloes over cosmic history. As well as giving important insights into the growth of cosmic structure in their own right, they provide an essential backbone to semi-analytic models of…
Merger trees are routinely used to follow the growth and merging history of dark matter haloes and subhaloes in simulations of cosmic structure formation. Srisawat et al. (2013) compared a wide range of merger-tree-building codes. Here we…
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…
We present a comparison of the statistical properties of dark matter halo merger trees extracted from the Millennium Simulation with Extended Press-Schechter (EPS) formalism and the related GALFORM Monte-Carlo method for generating…
We present a new method for calculating the merger history of matter halos in hierarchical clustering cosmologies. The linear density field is smoothed on a range of scales, these are then ordered in decreasing density and a merger tree…
Merge trees, a type of topological descriptor, serve to identify and summarize the topological characteristics associated with scalar fields. They present a great potential for the analysis and visualization of time-varying data. First,…
The interleaving distance is a key tool for comparing merge trees, which provide topological summaries of scalar functions. In this work, we define an average merge tree for a pair of merge trees using the interleaving distance. Since such…
We describe a simple efficient algorithm that allows one to construct Monte-Carlo realizations of merger histories of dark matter halos. The algorithm is motivated by the excursion set model (Bond et al. 1991) for the conditional and…
Merger tree codes are routinely used to follow the growth and merger of dark matter haloes in simulations of cosmic structure formation. Whereas in Srisawat et. al. we compared the trees built using a wide variety of such codes here we…
Dark matter (DM) halos form hierarchically in the Universe through a series of merger events. Cosmological simulations can represent this series of mergers as a graph-like ``tree'' structure. Previous work has shown these merger trees are…
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…
The merger and accretion probabilities of dark matter halos have so far only been calculated for an infinitesimal time interval. This means that a Monte-Carlo simulation with very small time steps is necessary to find the merger history of…
We present an algorithm for generating merger histories of dark matter haloes. The algorithm is based on the excursion set approach with moving barriers whose shape is motivated by the ellipsoidal collapse model of halo formation. In…
Halo merger trees describe the hierarchical mass assembly of dark matter haloes, and are the backbone for modeling galaxy formation and evolution. Merger trees constructed using Monte Carlo algorithms based on the extended Press-Schechter…
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.…
Merge trees are a type of graph-based topological summary that tracks the evolution of connected components in the sublevel sets of scalar functions. They enjoy widespread applications in data analysis and scientific visualization. In this…
Topological structures such as the merge tree provide an abstract and succinct representation of scalar fields. They facilitate effective visualization and interactive exploration of feature-rich data. A merge tree captures the topology of…
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…