Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

Density-clustering of continuous gravitational wave candidates from large surveys

MPG-Autoren
/persons/resource/persons224715

Steltner,  Benjamin
Searching for Continuous Gravitational Waves, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons252851

Menne,  Thorben
Searching for Continuous Gravitational Waves, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons20662

Papa,  Maria Alessandra
Searching for Continuous Gravitational Waves, AEI-Hannover, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons206570

Eggenstein,  Heinz-Bernd
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)

2207.14286.pdf
(Preprint), 2MB

PhysRevD.106.104063.pdf
(Verlagsversion), 630KB

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

Steltner, B., Menne, T., Papa, M. A., & Eggenstein, H.-B. (2022). Density-clustering of continuous gravitational wave candidates from large surveys. Physical Review D, 106(10): 104063.


Zitierlink: https://hdl.handle.net/21.11116/0000-000A-CCEC-7
Zusammenfassung
Searches for continuous gravitational waves target nearly monochromatic
gravitational wave emission from e.g. non-axysmmetric fast-spinning neutron
stars. Broad surveys often require to explicitly search for a very large number
of different waveforms, easily exceeding $\sim10^{17}$ templates. In such
cases, for practical reasons, only the top, say $\sim10^{10}$, results are
saved and followed-up through a hierarchy of stages. Most of these candidates
are not completely independent of neighbouring ones, but arise due to some
common cause: a fluctuation, a signal or a disturbance. By judiciously
clustering together candidates stemming from the same root cause, the
subsequent follow-ups become more effective. A number of clustering algorithms
have been employed in past searches based on iteratively finding symmetric and
compact over-densities around candidates with high detection statistic values.
The new clustering method presented in this paper is a significant improvement
over previous methods: it is agnostic about the shape of the over-densities, is
very efficient and it is effective: at a very high detection efficiency, it has
a noise rejection of $99.99\%$ , is capable of clustering two orders of
magnitude more candidates than attainable before and, at fixed sensitivity it
enables more than a factor of 30 faster follow-ups. We also demonstrate how to
optimally choose the clustering parameters.