Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

Driving unmodelled gravitational-wave transient searches using astrophysical information

MPG-Autoren
/persons/resource/persons40535

Salemi,  F.
Observational Relativity and Cosmology, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (beschränkter Zugriff)
Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.
Volltexte (frei zugänglich)

1805.04023.pdf
(Preprint), 2MB

Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Bacon, P., Gayathri, V., Chassande-Mottin, E., Pai, A., Salemi, F., & Vedovato, G. (2018). Driving unmodelled gravitational-wave transient searches using astrophysical information. Physical Review D, 98: 024028. doi:10.1103/PhysRevD.98.024028.


Zitierlink: https://hdl.handle.net/21.11116/0000-0001-5D9E-6
Zusammenfassung
Transient gravitational-wave searches can be divided into two main families
of approaches: modelled and unmodelled searches, based on matched filtering
techniques and time-frequency excess power identification respectively. The
former, mostly applied in the context of compact binary searches, relies on the
precise knowledge of the expected gravitational-wave phase evolution. This
information is not always available at the required accuracy for all plausible
astrophysical scenarios, e.g., in presence of orbital precession, or
eccentricity. The other search approach imposes little priors on the targetted
signal. We propose an intermediate route based on a modification of unmodelled
search methods in which time-frequency pattern matching is constrained by
astrophysical waveform models (but not requiring accurate prediction for the
waveform phase evolution). The set of astrophysically motivated patterns is
conveniently encapsulated in a graph, that encodes the time-frequency pixels
and their co-occurrence. This allows the use of efficient graph-based
optimization techniques to perform the pattern search in the data. We show in
the example of black-hole binary searches that such an approach leads to an
averaged increase in the distance reach (+7-8\%) for this specific source over
standard unmodelled searches.