Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCharacterising the Structure of Halo Merger Trees Using a Single Parameter: The Tree Entropy
137
0
0.0
(
0
)
Added by
Danail Obreschkow Dr
Publication date
2019
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Linking the properties of galaxies to the assembly history of their dark matter haloes is a central aim of galaxy evolution theory. This paper introduces a dimensionless parameter $sin[0,1]$, the tree entropy, to parametrise the geometry of a halos entire mass assembly hierarchy, building on a generalisation of Shannons information entropy. By construction, the minimum entropy ($s=0$) corresponds to smoothly assembled haloes without any mergers. In contrast, the highest entropy ($s=1$) represents haloes grown purely by equal-mass binary mergers. Using simulated merger trees extracted from the cosmological $N$-body simulation SURFS, we compute the natural distribution of $s$, a skewed bell curve peaking near $s=0.4$. This distribution exhibits weak dependences on halo mass $M$ and redshift $z$, which can be reduced to a single dependence on the relative peak height $delta_{rm c}/sigma(M,z)$ in the matter perturbation field. By exploring the correlations between $s$ and global galaxy properties generated by the SHARK semi-analytic model, we find that $s$ contains a significant amount of information on the morphology of galaxies $-$ in fact more information than the spin, concentration and assembly time of the halo. Therefore, the tree entropy provides an information-rich link between galaxies and their dark matter haloes.
rate research
Read More
We examine the effect of using different halo finders and merger tree building algorithms on galaxy properties predicted using the GALFORM semi-analytical model run on a high resolution, large volume dark matter simulation. The halo finders/tree builders HBT, ROCKSTAR, SUBFIND and VELOCIRAPTOR differ in their definitions of halo mass, on whether only spatial or phase-space information is used, and in how they distinguish satellite and main haloes; all of these features have some impact on the model galaxies, even after the trees are post-processed and homogenised by GALFORM. The stellar mass function is insensitive to the halo and merger tree finder adopted. However, we find that the number of central and satellite galaxies in GALFORM does depend slightly on the halo finder/tree builder. The number of galaxies without resolved subhaloes depends strongly on the tree builder, with VELOCIRAPTOR, a phase-space finder, showing the largest population of such galaxies. The distributions of stellar masses, cold and hot gas masses, and star formation rates agree well between different halo finders/tree builders. However, because VELOCIRAPTOR has more early progenitor haloes, with these trees GALFORM produces slightly higher star formation rate densities at high redshift, smaller galaxy sizes, and larger stellar masses for the spheroid component. Since in all cases these differences are small we conclude that, when all of the trees are processed so that the main progenitor mass increases monotonically, the predicted GALFORM galaxy populations are stable and consistent for these four halo finders/tree builders.
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 APIs for parallelisation, and includes python tools to read/manipulate the data products produced. The code correlates binding energy sorted particle ID lists between halo catalogues, determining optimal descendant/progenitor matches using multiple snapshots, a merit function that maximises the number of shared particles using pseudo-radial moments, and a scheme for correcting halo merger tree pathologies. Focusing on VELOCIraptor catalogues for this work, we demonstrate how searching multiple snapshots spanning a dynamical time significantly reduces the number of stranded halos, those lacking a descendant or a progenitor, critically correcting poorly resolved halos. We present a new merit function that improves the distinction between primary and secondary progenitors, reducing tree pathologies. We find FOF accretion rates and merger rates show similar mass ratio dependence. The model merger rates from Poole et al, (2017) agree with the measured net growth of halos through mergers.
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 physical locations). Our aim is to provide a new framework for halo merger tree generation that takes advantage of the results of large volume simulations, with a modest computational cost. We treat halo merger tree construction as a matrix generation problem, and propose a Generative Adversarial Network that learns to generate realistic halo merger trees. We evaluate our proposal on merger trees from the EAGLE simulation suite, and show the quality of the generated trees.
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 study the influence of the underlying halo catalogue upon the resulting trees. We observe that the specifics of halo finding itself greatly influences the constructed merger trees. We find that the choices made to define the halo mass are of prime importance. For instance, amongst many potential options different finders select self-bound objects or spherical regions of defined overdensity, decide whether or not to include substructures within the mass returned and vary in their initial particle selection. The impact of these decisions is seen in tree length (the period of time a particularly halo can be traced back through the simulation), branching ratio (essentially the merger rate of subhalos) and mass evolution. We therefore conclude that the choice of the underlying halo finder is more relevant to the process of building merger trees than the tree builder itself. We also report on some built-in features of specific merger tree codes that (sometimes) help to improve the quality of the merger trees produced.
The cosmic web plays a major role in the formation and evolution of galaxies and defines, to a large extent, their properties. However, the relation between galaxies and environment is still not well understood. Here we present a machine learning approach to study imprints of environmental effects on the mass assembly of haloes. We present a galaxy-LSS machine learning classifier based on galaxy properties sensitive to the environment. We then use the classifier to assess the relevance of each property. Correlations between galaxy properties and their cosmic environment can be used to predict galaxy membership to void/wall or filament/cluster with an accuracy of $93%$. Our study unveils environmental information encoded in properties of haloes not normally considered directly dependent on the cosmic environment such as merger history and complexity. Understanding the physical mechanism by which the cosmic web is imprinted in a halo can lead to significant improvements in galaxy formation models. This is accomplished by extracting features from galaxy properties and merger trees, computing feature scores for each feature and then applying support vector machine to different feature sets. To this end, we have discovered that the shape and depth of the merger tree, formation time and density of the galaxy are strongly associated with the cosmic environment. We describe a significant improvement in the original classification algorithm by performing LU decomposition of the distance matrix computed by the feature vectors and then using the output of the decomposition as input vectors for support vector machine.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
