Searches for Post-Merger Gravitational Waves with CoCoA: Sensitivity Projections Across Large Template Banks for Current and Next-Generation Detectors
Tanazza Khanam, Alessandra Corsi, Robert Coyne, Michael St. Pierre
TL;DR
The paper tackles the challenge of efficiently detecting intermediate-duration post-merger GWs from NS-NS mergers using CoCoA across large template banks. It introduces a Python framework to analytically estimate CoCoA distance horizons for various detector networks and waveform grids, enabling rapid identification of promising parameter-space regions and grid resolutions. Results show that next-generation networks (e.g., CE) significantly extend reach, with horizons up to several thousand megaparsecs, while current upgrades (O4) approach distances comparable to GW170817 for secular bar-mode magnetars. The work validates the approach by reproducing established results and discusses limitations, emphasizing CoCoA as a targeted complementary method to all-sky unmodeled searches and outlining future extensions to broader post-merger scenarios and longer-duration signals.
Abstract
The multi-messenger detection of the binary neutron star (NS) merger GW170817 has revolutionized the field of gravitational wave (GW) astronomy. However, several important questions remain to be answered. One of these is the nature of the compact remnant leftover by GW170817 (short- or long-lived NS versus black hole). A key goal going forward is to understand the diversity of NS-NS merger remnants, and how such diversity maps onto their viability as gamma-ray burst (GRB) central engines. Here, we present a study aimed at assessing the sensitivity of triggered searches for intermediate-duration, post-merger GWs powered by long-lived GRB remnants using networks of current and future ground-based GW detectors and the Cross-Correlation Algorithm (CoCoA). We develop a Python-based framework to efficiently estimate CoCoA distance horizons for a broad range of post merger secular bar-mode waveforms and for different GW detector networks. This framework can be used to identify the most promising regions of parameter space in which to concentrate search efforts, helping design future search strategies to optimally balance search sensitivity and related parameter space gridding schema against computational cost.
