Binary tree approach to template placement for searches for gravitational waves from compact binary mergers

Citations Over TimeTop 14% of 2023 papers

Abstract

We demonstrate a new geometric method for fast template placement for searches for gravitational waves from the inspiral, merger and ringdown of compact binaries. The method is based on a binary tree decomposition of the template bank parameter space into nonoverlapping hypercubes. We use a numerical approximation of the signal overlap metric at the center of each hypercube to estimate the number of templates required to cover the hypercube and determine whether to further split the hypercube. As long as the expected number of templates in a given cube is greater than a given threshold, we split the cube along its longest edge according to the metric. When the expected number of templates in a given hypercube drops below this threshold, the splitting stops and a template is placed at the center of the hypercube. Using this method, we generate aligned-spin template banks covering the mass range suitable for a search of Advanced LIGO, Advanced Virgo and KAGRA data. The aligned-spin bank was generated in $\ensuremath{\sim}24\text{ }\text{ }\mathrm{hours}$ using a single CPU core and produced 2 million templates. Our primary motivation for developing this algorithm is to produce a bank with useful geometric properties in the physical parameter space coordinates. Such properties are useful for population modeling and parameter estimation.

Related Papers

• How to Embed Trees in Hypercubes.(1985)
• → Simulating binary trees on hypercubes(2006)58 cited
• → Compact embedding of binary trees into hypercubes(1995)5 cited
• → Dense edge-disjoint embedding of complete binary trees in the hypercube(1993)4 cited
• → Edge-disjoint embedding of large full binary trees into hypercubes(2002)