A fast neural emulator for interstellar chemistry

Authors: A. Asensio Ramos, C. Westendorp Plaza, D. Navarro-Almaida, P. Rivière-Marichalar, V. Wakelam, A. Fuente

arXiv: 2406.02387v1 - DOI (astro-ph.IM)
12 pages, 8 figures, accepted for publication in MNRAS
License: CC BY 4.0

Abstract: Astrochemical models are important tools to interpret observations of molecular and atomic species in different environments. However, these models are time-consuming, precluding a thorough exploration of the parameter space, leading to uncertainties and biased results. Using neural networks to simulate the behavior of astrochemical models is a way to circumvent this problem, providing fast calculations that are based on real astrochemical models. In this paper, we present a fast neural emulator of the astrochemical code Nautilus based on conditional neural fields. The resulting model produces the abundance of 192 species for arbitrary times between 1 and 10$^7$ years. Uncertainties well below 0.2 dex are found for all species, while the computing time is of the order of 10$^4$ smaller than Nautilus. This will open up the possibility of performing much more complex forward models to better understand the physical properties of the interstellar medium. As an example of the power of these models, we ran a feature importance analysis on the electron abundance predicted by Nautilus. We found that the electron density is coupled to the initial sulphur abundance in a low density gas. Increasing the initial sulphur abundance from a depleted scenario to the cosmic abundance leads to an enhancement of an order of magnitude of the electron density. This enhancement can potentially influence the dynamics of the gas in star formation sites.

Submitted to arXiv on 04 Jun. 2024

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.