A continuous multiple hypothesis testing framework for optimal exoplanet detection

Authors: Nathan C. Hara, Thibault de Poyferré, Jean-Baptiste Delisle, Marc Hoffmann

arXiv: 2203.04957v1 - DOI (astro-ph.IM)
Submitted to Annals of Applied Statistics

Abstract: The detection of exoplanets is hindered by the presence of complex astrophysical and instrumental noises. Given the difficulty of the task, it is important to ensure that the data are exploited to their fullest potential. In the present work, we search for an optimal exoplanet detection criterion. We adopt a general Bayesian multiple hypothesis testing framework, where the hypotheses are indexed by continuous variables. This framework is adaptable to the different observational methods used to detect exoplanets as well as other data analysis problems. We describe the data as a combination of several parametrized patterns and nuisance signals. We wish to determine which patterns are present, and for a detection to be valid, the parameters of the claimed pattern have to correspond to a true one with a certain accuracy. We search for a detection criterion minimizing false and missed detections, either as a function of their relative cost, or when the expected number of false detections is bounded. We find that if the patterns can be separated in a technical sense, the two approaches lead to the same optimal procedure. We apply it to the retrieval of periodic signals in unevenly sampled time series, emulating the search for exoplanets in radial velocity data. We show on a simulation that, for a given tolerance to false detections, the new criterion leads to 15 to 30\% more true detections than other criteria, including the Bayes factor.

Submitted to arXiv on 09 Mar. 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.

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.