Asteroid mass estimation with the robust adaptive Metropolis algorithm
L. Siltala, M. Granvik

TL;DR
This paper introduces a robust Markov-chain Monte Carlo algorithm for estimating asteroid masses from close encounter data, providing more realistic uncertainty estimates and challenging some previous mass estimates like that of asteroid Psyche.
Contribution
The paper presents a novel MCMC-based method for asteroid mass estimation that better captures non-Gaussian uncertainties compared to traditional linearized approaches.
Findings
Synthetic data results match ground truth accurately.
Real asteroid mass estimates have larger uncertainties than previous reports.
The mass estimate for asteroid Psyche suggests a lower density than previously thought.
Abstract
The bulk density of an asteroid informs us about its interior structure and composition. To constrain the bulk density one needs an estimate for the mass of the asteroid. The mass is estimated by analyzing an asteroid's gravitational interaction with another object, such as another asteroid during a close encounter. An estimate for the mass has typically been obtained with linearized least-squares methods despite the fact that this family of methods is not able to properly describe non-Gaussian parameter distributions. In addition, the uncertainties reported for asteroid masses in the literature are sometimes inconsistent with each other and suspected to be unrealistically low. We present a Markov-chain Monte Carlo (MCMC) algorithm for the asteroid mass estimation problem based on asteroid-asteroid close encounters. We verify that our algorithm works correctly by applying it to…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
