The inner structure of CDM haloes -- I. A numerical convergence study
Bibliographic record
Abstract
We present a comprehensive set of convergence tests which explore the role of various numerical parameters on the equilibrium structure of a simulated dark matter halo. We report on results obtained with two independent, state-of-the-art, multi-stepping, parallel N-body codes: pkdgrav and gadget. We find that convergent mass profiles can be obtained for suitable choices of the gravitational softening, time-step, force accuracy, initial redshift, and particle number. For softenings chosen so that particle discreteness effects are negligible, convergence in the circular velocity is obtained at radii where the following conditions are satisfied: (i) the time-step is much shorter than the local orbital time-scale; (ii) accelerations do not exceed a characteristic acceleration imprinted by the gravitational softening; and (iii) enough particles are enclosed so that the collisional relaxation time-scale is longer than the age of the Universe. Convergence also requires sufficiently high initial redshift and accurate force computations. Poor spatial, time, or force resolution leads generally to systems with artificially low central density, but may also result in the formation of artificially dense central cusps. We have explored several adaptive time-stepping choices and we have obtained the best results when individual time-steps are chosen according to the local acceleration and the gravitational softening (Δti∝ (ε/ai)1/2), although further experimentation may yield better and more efficient criteria. The most stringent requirement for convergence is typically that imposed on the particle number by the collisional relaxation criterion. This implies that, in order to estimate accurate circular velocities at radii where the density contrast may reach ∼106, the region must enclose of the order of 3000 particles (or more than a few times 106 within the virial radius). Applying these criteria to a galaxy-sized ΛCDM halo, we find that the spherically averaged density profile becomes progressively shallower from the virial radius inwards, reaching a logarithmic slope shallower than −1.2 at the innermost resolved point, ∼0.005 r200, with little evidence for convergence to a power-law behaviour in the inner regions.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.008 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".