Search arXiv⌕ Search

arXiv · gr-qc/0605135

Catching Super Massive Black Hole Binaries Without a Net

Abstract

The gravitational wave signals from coalescing Supermassive Black Hole Binaries are prime targets for the Laser Interferometer Space Antenna (LISA). With optimal data processing techniques, the LISA observatory should be able to detect black hole mergers anywhere in the Universe. The challenge is to find ways to dig the signals out of a combination of instrument noise and the large foreground from stellar mass binaries in our own galaxy. The standard procedure of matched filtering against a grid of templates can be computationally prohibitive, especially when the black holes are spinning or the mass ratio is large. Here we develop an alternative approach based on Metropolis-Hastings sampling and simulated annealing that is orders of magnitude cheaper than a grid search. We demonstrate our approach on simulated LISA data streams that contain the signals from binary systems of Schwarzschild Black Holes, embedded in instrument noise and a foreground containing 26 million galactic binaries. The search algorithm is able to accurately recover the 9 parameters that describe the black hole binary without first having to remove any of the bright foreground sources, even when the black hole system has low signal-to-noise.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Neil J. Cornish, Edward K. Porter. 2006-08-09. Catching Super Massive Black Hole Binaries Without a Net. https://doi.org/10.1103/physrevd.75.021301

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

An upper bound on the minimum orbital period of black holes

Previous research has focused on establishing lower bounds on the minimum orbital period of black holes. In this work, we explore the complementary question of whether an upper bound exists for the minimum orbital period of black holes. We investigate the minimum orbital periods of three types of black holes: Schwarzschild, Reissner-Nordström and Kerr-Newman black holes. We find that the minimum orbital period of these black holes is bounded by an upper limit $T_{min} \leqslant 6\sqrt{3}πM$, where $M$ is the black hole mass. Our results suggest that this upper bound on the minimum orbital period may be a general property in black hole spacetimes.

gr-qc↗

Bounds on the minimum orbital period in the background of 5-dimensional charged black holes

In this paper, we study the upper and lower bounds on the minimum orbital period of 5-dimensional charged black holes. Our results indicate that the upper bound of the minimum orbital period corresponds to non-charged black holes, while the lower bound is achieved in the case of maximally charged black holes. We further establish precise analytical expressions for the upper and lower bounds of the minimum orbital period. Our findings provide valuable insights into 5-dimensional charged black holes and help constrain theoretical gravity models.

gr-qc↗

Analysis of minimum orbital periods around d-dimensional charged black holes

This paper investigates the bounds on the minimum orbital period for test objects around d-dimensional charged black holes in asymptotically flat spacetimes. We derive the exact critical radius and the minimum orbital period. We then prove analytically that the minimum orbital period decreases strictly as the charge of the black hole increases. Thus, the upper limit is reached for an uncharged black hole, while the lower limit is attained for a maximally charged one, and the two bounds take the closed form $\frac{2π(d-2)}{d-3}[(d-2)M]^{\frac{1}{d-3}}\leqslant T_{min} \leqslant 2π\sqrt{\frac{d-1}{d-3}}\,[(d-1)M]^{\frac{1}{d-3}}$. Since the minimum period equals $2π$ times the shadow radius, the upper bound is equivalently a universal upper bound on the shadow radius. These results improve our understanding of dynamics around d-dimensional black holes and impose constraints on candidate gravity theories.

gr-qc↗