Searching for Massive Black Hole Binaries in the first Mock LISA Data Challenge

Abstract

The Mock LISA Data Challenge is a worldwide effort to solve the LISA data analysis problem. We present here our results for the Massive Black Hole Binary (BBH) section of Round 1. Our results cover Challenge 1.2.1, where the coalescence of the binary is seen, and Challenge 1.2.2, where the coalescence occurs after the simulated observational period. The data stream is composed of Gaussian instrumental noise plus an unknown BBH waveform. Our search algorithm is based on a variant of the Markov Chain Monte Carlo method that uses Metropolis-Hastings sampling and thermostated frequency annealing. We present results from the training data sets and the blind data sets. We demonstrate that our algorithm is able to rapidly locate the sources, accurately recover the source parameters, and provide error estimates for the recovered parameters.

11 pages, 6 figures, Submitted to CQG proceedings of GWDAW 11, AEI, Germany, Dec 2006

Cited by in corpus (8)

• Building a stochastic template bank for detecting massive black hole binaries
• Report on the first round of the Mock LISA Data Challenges
• A Constrained Metropolis-Hastings Search for EMRIs in the Mock LISA Data Challenge 1B
• Extracting galactic binary signals from the first round of Mock LISA Data Challenges
• Improved time-frequency analysis of extreme-mass-ratio inspiral signals in mock LISA data
• A Three-Stage Search for Supermassive Black Hole Binaries in LISA Data
• A hierarchical search for gravitational waves from supermassive black hole binary mergers
• Markov chain Monte Carlo searches for Galactic binaries in Mock LISA Data Challenge 1B data sets