Papers › Asymptotic Analysis on Binned Likelihood and Neutrino Floor
Asymptotic Analysis on Binned Likelihood and Neutrino Floor
Jian Tang, Bing-Long Zhang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Observations of suspected coherent elastic neutrino-nucleus scatterings by dark matter direct detection experiments highlight the need for an investigation into the so-called "neutrino floor". We focus on the discovery limit, a statistical concept to identify the neutrino floor, and analyze the asymptotic behaviour of the profile binned likelihood ratio test statistic where the likelihood is constructed by variate from events in each bin and pull terms from neutrino fluxes. To achieve the asymptotic result, we propose two novel methods: i) Asymptotic-Analytic method, which furnishes the analytic result for large statistics, is applicable for more extra nuisance parameters, and enables the identification of the most relevant parameters in the statistical analysis; ii) Quasi-Asimov dataset, which is analogous to Asimov dataset but with improved speed. Applying our methods to the neutrino floor, we significantly accelerate the computation procedure compared to the previous literature, and successfully address cases where Asimov dataset fails. Our derivation on the asymptotic behavior of the test statistic not only facilitates research into the impact of neutrinos on the search for dark matter, but may also prove relevant in similar application scenarios.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections