REVIEW 3 cited by
The Search for Massive Black Hole Binaries with LISA
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
In this work we focus on the search and detection of Massive black hole binary (MBHB) systems, including systems at high redshift. As well as expanding on previous works where we used a variant of Markov Chain Monte Carlo (MCMC), called Metropolis-Hastings Monte Carlo, with simulated annealing, we introduce a new search method based on frequency annealing which leads to a more rapid and robust detection. We compare the two search methods on systems where we do and do not see the merger of the black holes. In the non-merger case, we also examine the posterior distribution exploration using a 7-D MCMC algorithm. We demonstrate that this method is effective in dealing with the high correlations between parameters, has a higher acceptance rate than previously proposed methods and produces posterior distribution functions that are close to the prediction from the Fisher Information matrix. Finally, after carrying out searches where there is only one binary in the data stream, we examine the case where two black hole binaries are present in the same data stream. We demonstrate that our search algorithm can accurately recover both binaries, and more importantly showing that we can safely extract the MBHB sources without contaminating the rest of the data stream.
Forward citations
Cited by 3 Pith papers
-
Handling Data Gaps for the Next Generation of Gravitational-Wave Observatories
Presents an efficient time-frequency Bayesian gap-filling technique that avoids costly matrix operations and integrates into LISA Global Fit, demonstrated on simulated LISA data.
-
DeepHMC : a deep-neural-network acclerated Hamiltonian Monte Carlo algorithm for binary neutron star parameter estimation
A neural-network surrogate for the log-likelihood gradients makes Hamiltonian Monte Carlo trajectories 30 times faster than relative-binning gradients and recovers LVK-consistent posteriors for two binary neutron star...
-
Detection and parameter estimation of supermassive black hole ringdown signals using a pulsar timing array
A likelihood-based search with particle swarm optimization can detect and estimate supermassive black hole ringdown signals in simulated pulsar timing array data, reaching 99% detection probability at SNR 10.
Discussion (0). Continue with ORCID to comment.