A dynamics-based density profile for dark haloes. I. Algorithm and basic results

Authors: Benedikt Diemer

arXiv: 2112.03921v1 - DOI (astro-ph.CO)
21 pages, 11 figures. Additional figures at http://www.benediktdiemer.com/data/halo-density-profiles/ . Comments welcome
License: CC BY-NC-SA 4.0

Abstract: The density profiles of dark matter haloes can potentially probe dynamics, fundamental physics, and cosmology, but some of the most promising signals reside near or beyond the virial radius. While these scales have recently become observable, the profiles at large radii are still poorly understood theoretically, chiefly because the distribution of orbiting matter (the one-halo term) is partially concealed by particles falling into halos for the first time. We present an algorithm to dynamically disentangle the orbiting and infalling contributions by counting the pericentric passages of billions of simulation particles. We analyse dynamically split profiles out to 10 R200m across a wide range of halo mass, redshift, and cosmology. We show that the orbiting term experiences a sharp truncation at the edge of the orbit distribution. Its sharpness and position are mostly determined by the mass accretion rate, confirming that the entire profile shape primarily depends on halo dynamics and secondarily on mass, redshift, and cosmology. The infalling term also depends on the accretion rate for fast-accreting haloes but is mostly set by the environment for slowly accreting haloes, leading to a diverse array of shapes that does not conform to simple theoretical models. While the resulting scatter in the infalling term reaches 1 dex, the scatter in the orbiting term is only between 0.1 and 0.4 dex and almost independent of radius. We demonstrate a tight correspondence between the redshift evolution in LCDM and the slope of the matter power spectrum.

Submitted to arXiv on 07 Dec. 2021

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.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.