Papers › QLUSTER: quick clusters of merging binary black holes
QLUSTER: quick clusters of merging binary black holes
Davide Gerosa, Matthew Mould
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This short document illustrates QLUSTER: a toy model for populations of binary black holes in dense astrophysical environments. QLUSTER is a simple tool to investigate the occurrence and properties of hierarchical black-hole mergers detectable by gravitational-wave interferometers. QLUSTER is not meant to rival the complexity of state-of-the-art population synthesis and N-body codes but rather provide a fast, approximate, and easy-to-interpret framework to investigate some of the key ingredients of the problem. These include the binary pairing probability, the escape speed of the host environment, and the merger generation. We also introduce the "hierarchical-merger efficiency" -- an estimator that quantifies the relevance of hierarchical black-hole mergers in a given astrophysical environment.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections