A dynamics-based density profile for dark haloes -- II. Fitting function

Authors: Benedikt Diemer

arXiv: 2205.03420v1 - DOI (astro-ph.CO)
19 pages, 9 figures. Additional figures at http://www.benediktdiemer.com/data
License: CC BY 4.0

Abstract: The density profiles of dark matter haloes are commonly described by fitting functions such as the NFW or Einasto models, but these approximations break down in the transition region where halos become dominated by newly accreting matter. In Paper I we dynamically split simulation particles into orbiting and infalling components and analysed their separate profiles. Here we propose simple, accurate fitting functions designed to capture the asymptotic shapes of the two terms at large and small radii. The orbiting term is described as a truncated Einasto profile, $\rho_{\rm orb} \propto \exp \left[-2/\alpha\ (r / r_{\rm s})^\alpha - 1/\beta\ (r / r_{\rm t})^\beta \right]$, with a five-parameter space of normalization, physically distinct scale and truncation radii, and $\alpha$ and $\beta$, which control how rapidly the profiles steepen. The infalling profile is modelled as a power law in overdensity that smoothly transitions to a constant at the halo centre. We show that these formulae fit the averaged, total profiles in simulations to about 5% accuracy across almost all of an expansive parameter space in halo mass, redshift, cosmology, and accretion rate. When fixing $\alpha = 0.18$ and $\beta = 3$, the formula becomes a three-parameter model for the orbiting term that fits individual halos better than the Einasto profile on average.

Submitted to arXiv on 06 May. 2022

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Beta

Look for similar papers (in beta version)

By clicking on the button above, our algorithm compares the title and abstract of this paper with all the papers of the same arXiv category that we have summarized, and finds the closest ones. You can rerun it from time to time: the results improve as our database grows.