adapting matched filtering searches for compact binary inspirals in lsc detector data

14
Adapting matched filtering searches for compact binary inspirals in LSC detector data. Chad Hanna – For the LIGO Scientific Collaboration.

Upload: kaili

Post on 29-Jan-2016

19 views

Category:

Documents


0 download

DESCRIPTION

Adapting matched filtering searches for compact binary inspirals in LSC detector data. Chad Hanna – For the LIGO Scientific Collaboration. Introduction. It is common to have single detector triggers at SNR ~1000 and millions of triggers at SNR 7. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Adapting matched filtering searches for compact binary inspirals in LSC

detector data.

Chad Hanna – For the LIGO Scientific Collaboration.

Page 2: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Introduction

• It is common to have single detector triggers at SNR ~1000 and millions of triggers at SNR 7.

• At the end of the pipeline we want only a few interesting candidates to follow

• To do this we tune our pipeline with injections.• We try to separate injections from noise while

assuring all (>99%) of injections which are detected at the onset survive the pipeline.

Page 3: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Outline

• Coincidence – timing, mass, psi, etc.

• Effective distance cuts – amplitude consistency

• Signal based vetoes – X2, r2

• detection statistics (or how to separate the good stuff from the noise)

• Background estimation – time slides

When applicable I will discuss the following for three different inspiral searches: Binary Neutron Star (BNS), Primordial Black Hole Binaries (PBHB), Binary Black Hole (BBH).

Page 4: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Coincidence parameter philosophy (BNS, PBHB, BBH)

• Injections are used to determine how a coincident event should be defined

• For BNS, PBHB, BBH we compare the end time that we inject with what we detect for a single instrument. The error in time found in the single detector establishes a coincident window we then apply to triggers between sites. (Of course the maximum GW travel time between sites is automatically accounted for.)

• For BNS, PBHB, we can repeat the procedure for chirp mass and (which are both functions of the masses.) But the BBH case is more difficult, which I will explain.

• In all cases it is our philosophy to choose such windows generously as to not miss a detection.

Page 5: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Coincidence parameters (BNS,PBHB)

End time

We compare the end time of found injections with the injected end time insingle detectors to place bounds on the coincidence windows between detectors.

S3 BNS timing coincidence window 2 msS3 PBH timing coincidence window 4 ms

PBHB

BNS

Seconds difference

Page 6: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Coincidence parameters (BBH)

BBH – EOB

End timeThe BBH search is complicated byinjecting several physical template families some of which produce tails in the timingdistribution when detected with BCV templates. The worst case parameters are chosen.

BBH – Taylor T1

S3 BBH timing window 25ms

Page 7: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Coincidence parameters (BNS,PBHB)

Chirp mass

We compare the chirp mass of found injections with the injected chirp mass insingle detectors to place bounds on the chirp mass coincidence windows between detectors.

S3 BNS chirp mass window .02 Mּס S3 PBHB timing window .002 Mּס

PBHB

BNS

Page 8: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Coincidence parameters (BBH)

BBH EOB0, 3

The BBH search doesn’t tune mass but rather the BCV parameters 0, 3. These are not injection parameters and therefore the singledetector scheme shown in the previous slidesdoesn’t work. Instead we must look at coincidences before we choose the 0, 3

coincidence windows.

The BBH windows are 0 = 40000 3 = Full range.

BBH EOB

Page 9: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Effective Distance Cut (BNS,PBHB)

Injections (and real GW signals) have effective distance ratios which are close to unity for H1 and H2 (within calibration errors). Therefore any triggers which are found to have non unity effective distances are not consistent with real GW sources and may be disregarded.

BNS PBHB

BNS fractional difference in effective distance cut = 0.45

PBHB fractional difference in effective distance cut = 0.50

Fractional difference in eff. distance

Page 10: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Signal based vetoes - 2 - (PBHB,BNS)

2

The 2 test is a waveformconsistency test to separate realsignals from false alarms.

We actually adjust the 2 to be a

function of P (the number of frequency bins), 2 (SNR_, and \a parameter called 2. I will denoteThis modified 2 as *2 .

2 should be the bank mismatch But it is tuned to not lose nearbyinjections. *2 = 2/(P+ 22)

Page 11: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Signal Based Vetoes - r2 - (PBHB,BNS)

r2

See poster by Andy Rodriguez

The 2 test itself is powerful but itcan be refined further by examining the timeA signal spends above the r2 threshold. An injection spends little time above, whereas glitches (false alarms) spend a lot of time above.

BNS

r2 = 2/p

Page 12: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Detection Statistics (BNS, PBHB)

Now that we have a nice waveformconsistency test (2 ), SNR alone is not the best way to separate false Coincidences from injections.

There is a better statistic whichinvolves a combination of SNRand Χ2

Lines of constant S follow thecontours of accidental coincidences quite well.

The 250 is found empirically.

BNS

PBHB

Page 13: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Background Estimation / Combined Statistic (PBHB,BNS)

PBHB

BNS

In order to differentiate between realsignals and background we examinefalse coincidences by sliding the triggersets of one detector with respect to another in time. A typical search hasmore than 50 slides where two of threedetectors are slid by ~5-10 seconds eachtime.

Using the statistic discussed earlier, in a combined way (e.g. H1S + L1S), lines of constant false alarm are approximated by the linear statistic contours between detectors.

Page 14: Adapting matched filtering searches for compact binary inspirals in LSC     detector data

Conclusion

• BNS, PBHB, and BBH searches are similar in that they must overcome messy data.

• Although the procedures for each search vary the philosophy remains to have a few good candidates at the end with little question about missing a detection