A Merger Tree with Microsolar Mass Resolution: Application to $\gamma$-ray Emission from Subhalo Population
Carlo Giocoli (UniPD, OaPD, ITA-Heidelberg), Lidia Pieri (UniPD, CIFS, TO, INFN-PD), Giuseppe Tormen (UniPD), Jorge Moreno (Haverford College-PA)

TL;DR
This paper develops a detailed merger tree model with microsolar mass resolution to study dark matter subhalo populations and their gamma-ray emission, focusing on Milky-Way and Draco dwarf galaxy scenarios.
Contribution
It introduces a modified Sheth & Lemson algorithm for high-resolution merger trees and applies it to analyze gamma-ray signals from dark matter subhaloes.
Findings
Subhaloes alone cannot provide the boost factor for gamma-ray detection.
The model accurately traces sub-subhalo populations within larger haloes.
Gamma-ray detectability of subhaloes is limited without additional boost factors.
Abstract
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 cold dark matter power spectrum, and model the growth of a Milky-Way sized halo with microsolar mass resolution, corresponding to the typical Jeans mass for a dark matter Weakly Interacting Massive Particle with mass of 100 GeV. We then compute the \emph{unevolved} subhalo mass function and build-up a Milky-Way halo placing and evolving its satellites. This subhalo population is used to study the -ray emission from dark matter annihilation. In this case, the subhaloes which populate the host halo have been computed considering only progenitor haloes accreted by the main branch of the tree, so as to correctly treat the embedding of sub-subhaloes inside…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
