ﻻ يوجد ملخص باللغة العربية
In hierarchical searches for continuous gravitational waves, clustering of candidates is an important postprocessing step because it reduces the number of noise candidates that are followed-up at successive stages [1][7][12]. Previous clustering procedures bundled together nearby candidates ascribing them to the same root cause (be it a signal or a disturbance), based on a predefined cluster volume. In this paper, we present a procedure that adapts the cluster volume to the data itself and checks for consistency of such volume with what is expected from a signal. This significantly improves the noise rejection capabilities at fixed detection threshold, and at fixed computing resources for the follow-up stages, this results in an overall more sensitive search. This new procedure was employed in the first Einstein@Home search on data from the first science run of the advanced LIGO detectors (O1) [11].
We present a new veto procedure to distinguish between continuous gravitational wave (CW) signals and the detector artifacts that can mimic their behavior. The veto procedure exploits the fact that a long-lasting coherent disturbance is less likely t
$chi^2$ vetoes are commonly used in searching for gravitational waves, in particular for broad-band signals, but they can also be applied to narrow-band continuous wave signals, such as those expected from rapidly rotating neutron stars. In this pape
Gravitational wave astronomy opened dramatically in September 2015 with the LIGO discovery of a distant and massive binary black hole coalescence. The more recent discovery of a binary neutron star merger, followed by a gamma ray burst and a kilonova
This document describes a code to perform parameter estimation and model selection in targeted searches for continuous gravitational waves from known pulsars using data from ground-based gravitational wave detectors. We describe the general workings
Wide parameter space searches for long lived continuous gravitational wave signals are computationally limited. It is therefore critically important that available computational resources are used rationally. In this paper we consider directed search