Testing the binary hypothesis: pulsar timing constrains on supermassive black hole binary candidates

Auteurs : A. Sesana, Z. Haiman, B. Kocsis, L. Z. Kelley

arXiv: 1703.10611v1 - DOI (astro-ph.HE)
13 pages, 12 figures, 1 table. Submitted to MNRAS

Résumé : The advent of time domain astronomy is revolutionising our understanding of the Universe. Programs such as the Catalina Real-time Transient Survey (CRTS) or the Palomar Transient Factory (PTF) surveyed millions of objects for several years, allowing variability studies on large statistical samples. The inspection of $\approx$ 250k quasars in CRTS resulted in a catalogue of 111 potentially periodic sources, put forward as supermassive black hole binary (SMBHB) candidates. A similar investigation on PTF data yielded 33 candidates from a sample of 33k objects. Working under the SMBHB hypothesis, we compute the implied SMBHB merger rate and we use it to construct the expected gravitational wave background (GWB) at nano-Hz frequencies, probed by pulsar timing arrays (PTAs). After correcting for incompleteness, we find that the implied GWB exceeds the current most stringent PTA upper limits by almost an order of magnitude for the CRTS sample, and by at least a factor of 2-3 for the PTF sample. Eccentricity and/or coupling with the environment can only suppress the signal by a factor of $\approx 2$ in the relevant frequency range and cannot account for the inconsistency. The inferred GWB can be reconciled with the PTA upper limits only if nearly all 111 candidates are false positives and AGN hosting a single SMBH exhibit prominent variability without the need of an SMBH companion. Alternatively, alleviating this severe tension would require that the typical black hole mass has been overestimated by a factor of $\gtrsim 4$, very low typical mass ratios $q=M_2/M_1<0.01$, or else that the loudest gravitational wave sources are preferentially false positives.

Soumis à arXiv le 30 Mar. 2017

Explorez l'arbre d'article

Cliquez sur les nœuds de l'arborescence pour être redirigé vers un article donné et accéder à leurs résumés et assistant virtuel

Accédez également à nos Résumés, ou posez des questions sur cet article à notre Assistant IA.

Beta

Recherchez des articles similaires (en version bêta)

En cliquant sur le bouton ci-dessus, notre algorithme compare le titre et le résumé de cet article à tous les articles de la même catégorie arXiv que nous avons résumés, et trouve les plus proches. Vous pouvez le relancer de temps en temps : les résultats s'améliorent à mesure que notre base grandit.