arXiv · 2611.13083
Less is More: Unbiased Galaxy Clustering from Fewer Merger Trees
Abstract
Galaxy clustering could strongly constrain galaxy formation models but is rarely used, because the two-point correlation function (2PCF) requires a complete galaxy catalogue at every point in parameter space. Semi-analytic models (SAMs) process each halo merger tree independently, so running a SAM on $m$ of $k$ disjoint partitions of the trees, each spanning the full box, cuts the cost by $k/m$. Because a halo's galaxies are kept or discarded together, one-halo pairs are diluted less than two-halo pairs, and the naive estimate overstates small-scale clustering by a factor $k/m$. We introduce the Sparse and Unbiased Clustering Estimator (SaUCE), which removes this bias with weights set by $m$ and $k$ alone. It has no free parameters, gives exactly unbiased pair counts, and applies to any catalogue built from a random subset of whole haloes and to any pair-count statistic. Running a SAM on 7 per cent of the P-Millennium merger trees, 68 per cent of random selections recover the full-box $ξ(r)$ at $z=0$ to within 0.05 dex in each bin from 0.03 to $30\,h^{-1}\,\mathrm{Mpc}$, at a density of $10^{-2}\,h^{3}\,\mathrm{Mpc}^{-3}$: a fourteen-fold computational saving. The required fraction rises with redshift and as the number density falls, is the same for two model variants, and transfers between boxes through the galaxy and pair counts. The scatter, derived in closed form, is strongly correlated between bins, so a likelihood must use the full covariance. A recipe for choosing the fraction makes the 2PCF affordable for model calibration and simulation-based inference.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Oscar J. Hickman, Sownak Bose, Kai Wang, Carlton M. Baugh, Baojiu Li. 2026-11-09. Less is More: Unbiased Galaxy Clustering from Fewer Merger Trees. https://searcharxiv.com/abs/2611.13083
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.