A Solution to the Galactic Foreground Problem for LISA
arXiv:astro-ph/0611546 · doi:10.1103/PhysRevD.75.043008
Abstract
Low frequency gravitational wave detectors, such as the Laser Interferometer Space Antenna (LISA), will have to contend with large foregrounds produced by millions of compact galactic binaries in our galaxy. While these galactic signals are interesting in their own right, the unresolved component can obscure other sources. The science yield for the LISA mission can be improved if the brighter and more isolated foreground sources can be identified and regressed from the data. Since the signals overlap with one another we are faced with a ``cocktail party'' problem of picking out individual conversations in a crowded room. Here we present and implement an end-to-end solution to the galactic foreground problem that is able to resolve tens of thousands of sources from across the LISA band. Our algorithm employs a variant of the Markov Chain Monte Carlo (MCMC) method, which we call the Blocked Annealed Metropolis-Hastings (BAM) algorithm. Following a description of the algorithm and its implementation, we give several examples ranging from searches for a single source to searches for hundreds of overlapping sources. Our examples include data sets from the first round of Mock LISA Data Challenges.
19 pages, 27 figures
References in corpus (1)
Cited by in corpus (10)
- Tests of Bayesian Model Selection Techniques for Gravitational Wave Astronomy
- Subtraction-noise projection in gravitational-wave detector networks
- A Constrained Metropolis-Hastings Search for EMRIs in the Mock LISA Data Challenge 1B
- Improved time-frequency analysis of extreme-mass-ratio inspiral signals in mock LISA data
- Extracting galactic binary signals from the first round of Mock LISA Data Challenges
- A LISA Data-Analysis Primer
- A Three-Stage Search for Supermassive Black Hole Binaries in LISA Data
- Inference on white dwarf binary systems using the first round Mock LISA Data Challenges data sets
- Delayed rejection schemes for efficient Markov-Chain Monte-Carlo sampling of multimodal distributions
- Markov chain Monte Carlo searches for Galactic binaries in Mock LISA Data Challenge 1B data sets