CWTHF: Subhalo Identification with Continuous Wavelet Transform
Minxing Li, Yun Wang, Ping He
TL;DR
This paper extends the continuous wavelet transform halo finder (CWTHF) to identify subhalos within cosmological simulations by adding an unbinding-based substructure procedure and a recursive, cross-scale peak extraction that builds a hierarchical halo catalog. The approach preserves the original $\mathcal{O}(N)$ time complexity and leverages 4D wavelet maxima (3D space + scale) to locate substructures, with a fast maximum-exclusion step to prevent duplicates. Validation against IllustrisTNG datasets (TNG50-2 and TNG100-1) shows CWTHF recovers major substructures with a high degree of stability relative to SUBFIND, though it identifies fewer small satellites due to a limited scale range and background contamination; zoom-in tests demonstrate that expanding the scale range can recover more subhalos, confirming the method’s potential with adequate parameter choices. The work provides a fast, wavelet-based subhalo finder, highlights parameter dependencies on SHMF/SHPS, discusses limitations related to background contamination, and points to future optimizations (e.g., improved unbinding, domain decomposition) and publicly available code for community use.
Abstract
With advances in cosmology and computer science, cosmological simulations now resolve structures in increasingly fine detail. As key tracers of hierarchical structure formation, subhalos are among the most important objects within these simulations. In our previous work, we established that the continuous wavelet transform (CWT) can effectively extract clustering information and serve as a robust halo finder. Here, we extend the CWT framework to subhalo identification by adapting the CWTHF (Continuous Wavelet Transform Halo Finder) code. This extension extends the unbinding procedure, which enables the reliable identification of gravitationally bound substructures. The algorithm identifies density peaks within known halos or subhalos and segments the surrounding volume accordingly. Once a new subhalo is registered, its position is recorded to prevent duplicate detection. We validate our approach using the TNG50-2 and TNG100-1 simulations, as well as a single Friends-of-Friends (FOF) halo, by comparing the resulting CWT catalog against the reference SUBFIND catalog. Because the method inherits the original computational framework, our subhalo finder maintains a favorable linear time complexity of $\mathcal{O}(N)$.
