Evaluating radiation transport errors in merger simulations using a Monte Carlo algorithm
Bibliographic record
Abstract
Neutrino-matter interactions play an important role in the postmerger evolution of neutron star-neutron star and black hole-neutron star mergers. Most notably, they determine the properties of the bright optical/infrared transients observable after a merger. Unfortunately, Boltzmann's equations of radiation transport remain too costly to be evolved directly in merger simulations. Simulations rely instead on approximate transport algorithms with unquantified modeling errors. In this paper, we use for the first time a time-dependent general relativistic Monte Carlo (MC) algorithm to solve Boltzmann's equations and estimate important properties of the neutrino distribution function $\ensuremath{\sim}10\text{ }\text{ }\mathrm{ms}$ after a neutron star merger that resulted in the formation of a massive neutron star surrounded by an accretion disk. We do not fully couple the MC algorithm to the fluid evolution, but use a short evolution of the merger remnant to critically assess errors in our approximate gray two-moment transport scheme. We demonstrate that the analytical closure used by the moment scheme is highly inaccurate in the polar regions, but performs well elsewhere. While the average energy of polar neutrinos is reasonably well captured by the two-moment scheme, estimates for the neutrino energy become less accurate at lower latitudes. The two-moment formalism also overestimates the density of neutrinos in the polar regions by $\ensuremath{\sim}50%$, and underestimates the neutrino pair-annihilation rate at the poles by factors of 2--3. Although the latter is significantly more accurate than one might have expected before this study, our results indicate that predictions for the properties of polar outflows and for the creation of a baryon-free region at the poles are likely to be affected by errors in the two-moment scheme, thus limiting our ability to reliably model kilonovae and gamma-ray bursts.
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.010 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| 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".