Multiscale entropy analysis of astronomical time series. Discovering subclusters of hybrid pulsators

Authors: Jeroen Audenaert, Andrew Tkachenko

A&A 666, A76 (2022)
arXiv: 2206.13529v1 - DOI (astro-ph.SR)
14 pages, 15 figures, 2 tables, Accepted for publication in Astronomy & Astrophysics
License: CC BY 4.0

Abstract: The multiscale entropy assesses the complexity of a signal across different timescales. It originates from the biomedical domain and was recently successfully used to characterize light curves as part of a supervised machine learning framework to classify stellar variability. We explore the behavior of the multiscale entropy in detail by studying its algorithmic properties in a stellar variability context and by linking it with traditional astronomical time series analysis methods. We subsequently use the multiscale entropy as the basis for an interpretable clustering framework that can distinguish hybrid pulsators with both p- and g-modes from stars with only p-mode pulsations, such as $\delta$ Sct stars, or from stars with only g-mode pulsations, such as $\gamma$ Dor stars. We find that the multiscale entropy is a powerful tool for capturing variability patterns in stellar light curves. The multiscale entropy provides insights into the pulsation structure of a star and reveals how short- and long-term variability interact with each other based on time-domain information only. We also show that the multiscale entropy is correlated to the frequency content of a stellar signal and in particular to the near-core rotation rates of g-mode pulsators. We find that our new clustering framework can successfully identify the hybrid pulsators with both p- and g-modes in sets of $\delta$ Sct and $\gamma$ Dor stars, respectively. The benefit of our clustering framework is that it is unsupervised. It therefore does not require previously labeled data and hence is not biased by previous knowledge.

Submitted to arXiv on 27 Jun. 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.