Fast Algorithms and Efficient Statistics: N-Point Correlation Functions
Open accessThe DOI matches its Crossref record.
Abstract
We present here a new algorithm for the fast computation of N-point correlation functions in large astronomical data sets. The algorithm is based on kdtrees which are decorated with cached sufficient statistics thus allowing for orders of magnitude speed-ups over the naive non-tree-based implementation of correlation functions. We further discuss the use of controlled approximations within the computation which allows for further acceleration. In summary, our algorithm now makes it possible to compute exact, all-pairs, measurements of the 2, 3 and 4-point correlation functions for cosmological data sets like the Sloan Digital Sky Survey (SDSS; York et al. 2000) and the next generation of Cosmic Microwave Background experiments (see Szapudi et al. 2000).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2020) · Nature Methods · doi:10.1038/s41592-019-0686-2 · Cited by 38,430
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2019) · Apollo - University of Cambridge Repository · doi:10.17863/cam.64134 · Cited by 10,460
emerge – an empirical model for the formation of galaxies since z ∼ 10
Moster, B. P., Naab, T., & White, S. D. M. (2018) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/sty655 · Cited by 423
Data mining and machine learning in astronomy
BALL, N. M., & BRUNNER, R. J. (2010) · International Journal of Modern Physics D · doi:10.1142/s0218271810017160 · Cited by 383
The skewness of the aperture mass statistic
Jarvis, M., Bernstein, G., & Jain, B. (2004) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2004.07926.x · Cited by 326
nbodykit: An Open-source, Massively Parallel Toolkit for Large-scale Structure
Hand, N., Feng, Y., Beutler, F., Li, Y., Modi, C., Seljak, U., & Slepian, Z. (2018) · The Astronomical Journal · doi:10.3847/1538-3881/aadae0 · Cited by 286
Empirical constraints on the formation of early-type galaxies
Moster, B. P., Naab, T., & White, S. D. M. (2019) · arXiv · doi:10.48550/arxiv.1910.09552 · Cited by 55
“We calculate the real space galaxy two-point correlation functions ξ(r) using kd-trees following Moore et al. (2001) and Dolence & Brunner (2008), and derive the projected correlation functions wp(rp) at the same projected radii as the observations.”
Methodemerge – empirical constraints on the formation of passive galaxies
Moster, B. P., Naab, T., & White, S. D. M. (2020) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/staa3019 · Cited by 55
“We calculate the real space galaxy two-point correlation functions ξ(r) using kd-trees following Moore et al. (2001) and Dolence & Brunner (2008), and derive the projected correlation functions wp(rp) at the same projected radii as the observations.”
Method
Metadata
- Authors
- Moore, A. W., Connolly, A. J., Genovese, C., Gray, A., Grone, L., Kanidoris II, N., Nichol, R. C., Schneider, J., Szalay, A. S., Szapudi, I., & Wasserman, L.
- Venue
- ESO ASTROPHYSICS SYMPOSIA
- Publisher
- Springer-Verlag
- Published
- 2006-02-10
- Pages
- 71-82
- OpenAlex
- W1775163074
- Cited by
- 75
- References
- 0
- FWCI
- 8.91
- Type
- book chapter
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.