TL;DR
The paper introduces CORBITS, an efficient semi-analytical algorithm that accurately computes the geometric probabilities of multiple transiting exoplanets, improving speed and precision over previous methods, and applies it to Kepler data.
Contribution
It presents CORBITS, a novel semi-analytical algorithm for calculating multi-transiting exoplanet probabilities, surpassing previous numerical approaches in accuracy and efficiency.
Findings
CORBITS is faster and more accurate than previous algorithms.
The solar system could show up to 3 transiting planets at once.
Kepler's multi-planet candidate distributions shift to larger values after correction.
Abstract
NASA's Kepler Space Telescope has successfully discovered thousands of exoplanet candidates using the transit method, including hundreds of stars with multiple transiting planets. In order to estimate the frequency of these valuable systems, it is essential to account for the unique geometric probabilities of detecting multiple transiting extrasolar planets around the same parent star. In order to improve on previous studies that used numerical methods, we have constructed an efficient, semi-analytical algorithm called CORBITS which, given a collection of conjectured exoplanets orbiting a star, computes the probability that any particular group of exoplanets can be observed to transit. The algorithm applies theorems of elementary differential geometry to compute the areas bounded by circular curves on the surface of a sphere (see Ragozzine & Holman 2010). The implemented algorithm is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
