Papers › Improving the accuracy of estimators for the two-point correlation function
Improving the accuracy of estimators for the two-point correlation function
Martin Kerscher
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.
We show how to increase the accuracy of estimates of the two-point correlation function without sacrificing efficiency. We quantify the error of the pair-counts and of the Landy-Szalay estimator by comparing them with exact reference values. The standard method, using random point sets, is compared to geometrically motivated estimators and estimators using quasi-Monte~Carlo integration. In the standard method, the error scales proportionally to 1/√(Nᵣ), with Nᵣ being the number of random points. In our improved methods, the error scales almost proportionally to 1/N_q, where N_q is the number of points from a low-discrepancy sequence. We study the run times of the new estimator in comparison to those of the standard estimator, keeping the same level of accuracy. For the considered case, we always see a speedup ranging from 50% up to a factor of several thousand. We also discuss how to apply these improved estimators to incompletely sampled galaxy catalogues.
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