Parameter estimation for compact binaries with ground-based gravitational-wave observations using the LALInference software library
Authors:
- J. VeitchJVJ. Veitch
- V. RaymondVRV. Raymond
- B. FarrBFB. Farr
- W. FarrWFW. Farr
- P. GraffPGP. Graff
- S. VitaleSVS. Vitale
- B. AylottBAB. Aylott
- K. BlackburnKBK. Blackburn
- N. ChristensenNCN. Christensen
- M. CoughlinMCM. Coughlin
- W. Del PozzoWPW. Del Pozzo
- F. FerozFFF. Feroz
Top Cited Papers
Open Access
- 6 February 2015
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review D
- Vol. 91 (4) , 042003
Abstract
The Advanced LIGO and Advanced Virgo gravitational-wave (GW) detectors will begin operation in the coming years, with compact binary coalescence events a likely source for the first detections. The gravitational waveforms emitted directly encode information about the sources, including the masses and spins of the compact objects. Recovering the physical parameters of the sources from the GW observations is a key analysis task. This work describes the LALInference software library for Bayesian parameter estimation of compact binary signals, which builds on several previous methods to provide a well-tested toolkit which has already been used for several studies. We show that our implementation is able to correctly recover the parameters of compact binary signals from simulated data from the advanced GW detectors. We demonstrate this with a detailed comparison on three compact binary systems: a binary neutron star, a neutron star–black hole binary and a binary black hole, where we show a cross comparison of results obtained using three independent sampling algorithms. These systems were analyzed with nonspinning, aligned spin and generic spin configurations respectively, showing that consistent results can be obtained even with the full 15-dimensional parameter space of the generic spin configurations. We also demonstrate statistically that the Bayesian credible intervals we recover correspond to frequentist confidence intervals under correct prior assumptions by analyzing a set of 100 signals drawn from the prior. We discuss the computational cost of these algorithms, and describe the general and problem-specific sampling techniques we have used to improve the efficiency of sampling the compact binary coalescence parameter space.Keywords
All Related Versions
Funding Information
- National Science Foundation (PHY-0923409, PHY-0600953, DGE 1144152, PHY-0757058, PHY-1204371, PHY-0970074, PHY-1307429)
- Stichting voor Fundamenteel Onderzoek der Materie
- Netherlands Organization for Scientific Research
- California Institute of Technology
- Goddard Space Flight Center
- National Aeronautics and Space Administration
- Royal Society
- Leverhulme Trust
- Newton Trust
- Science and Technology Facilities Council (ST/K005014/1, ST/L000946/1)
- LIGO-Virgo Collaboration
- LIGO Laboratory
- NSF LIGO (PHY-1307020)
- UWM Research Growth Initiative
This publication has 69 references indexed in Scilit:
- Parameter estimation for compact binary coalescence signals with the first generation gravitational-wave detector networkPhysical Review D, 2013
- TOWARD EARLY-WARNING DETECTION OF GRAVITATIONAL WAVES FROM COMPACT BINARY COALESCENCEThe Astrophysical Journal, 2012
- Modelling coloured residual noise in gravitational-wave signal processingClassical and Quantum Gravity, 2010
- Nested sampling for general Bayesian computationBayesian Analysis, 2006
- Phasing of gravitational waves from inspiralling eccentric binaries at the third-and-a-half post-Newtonian orderPhysical Review D, 2006
- Detecting gravitational waves from precessing binaries of spinning compact objects: Adiabatic limitPhysical Review D, 2003
- Using Markov chain Monte Carlo methods for estimating parameters with gravitational radiation dataPhysical Review D, 2001
- Marginal Likelihood from the Gibbs OutputJournal of the American Statistical Association, 1995
- The Well-Calibrated BayesianJournal of the American Statistical Association, 1982
- An Automatic Method for Finding the Greatest or Least Value of a FunctionThe Computer Journal, 1960