Related papers: Fast Algorithms and Efficient Statistics: N-point …
We present an algorithm that computes the multipole coefficients of the galaxy three-point correlation function (3PCF) without explicitly considering triplets of galaxies. Rather, centering on each galaxy in the survey, it expands the…
In this paper we presented the algorithm designed to efficient coordinate cross-match of objects in the modern massive astronomical catalogues. Preliminary data sort in the existed catalogues provides the opportunity for coordinate…
We propose fast, exact and efficient algorithms for the convolution of two arbitrary functions on the sphere which speed up computations by a factor \order{\sqrt{N}} compared to present methods where $N$ is the number of pixels. No…
Nonparametric correlations such as Spearman's rank correlation and Kendall's tau correlation are widely applied in scientific and engineering fields. This paper investigates the problem of computing nonparametric correlations on the fly for…
We present an optimised multipole algorithm for computing the three-point correlation function (3PCF), tailored for application to large-scale cosmological datasets. The algorithm builds on a $in\, situ$ interpretation of correlation…
The two-point correlation function of the galaxy distribution is a key cosmological observable that allows us to constrain the dynamical and geometrical state of our Universe. To measure the correlation function we need to know both the…
Based on the Beylkin-Cramer summation rule, we introduce a new fast algorithm that enable us to explore the high order statistics efficiently in large data sets. Central to this technique is to make decomposition both of fields and…
Though Fourier Transforms (FTs) are a common technique for finding correlation functions, they are not typically used in computations of the anisotropy of the two-point correlation function (2PCF) about the line of sight in wide-angle…
We present a robust and fast algorithm for performing astrometry and source cross-identification on two dimensional point lists, such as between a catalogue and an astronomical image, or between two images. The method is based on minimal…
We have developed a new analytic method to calculate the galaxy two-point correlation functions (TPCFs) accurately and efficiently, applicable to surveys with finite, regular, and mask-free geometries. We have derived simple, accurate…
We present a new pipeline designed for the robust inference of cosmological parameters using both second- and third-order shear statistics. We build a theoretical model for rapid evaluation of three-point correlations using our fastnc code…
Here we show how to produce a 3D density field with a given set of higher-order correlation functions. Our algorithm enables producing any desired two-point, three-point, and four-point functions, including odd-parity for the latter. We…
Computation of correlation functions is a key operation in Lattice quantum chromodynamics (LQCD) simulations to extract nuclear physics observables. These functions involve many binary batch tensor contractions, each tensor possibly…
We propose a new pattern-matching algorithm for matching CCD images to a stellar catalogue based statistical method in this paper. The method of constructing star pairs can greatly reduce the computational complexity compared with the…
The ability to record from increasingly large numbers of neurons, and the increasing attention being paid to large scale neural network simulations, demands computationally fast algorithms to compute relevant statistical measures. We…
Higher-order correlation functions are firmly established as a fundamental tool for the statistical analysis of clustering in modern galaxy surveys. It was demonstrated that they greatly enrich the information content extracted by two-point…
We present a new $\texttt{python}$ package SARABANDE for measuring 3 & 4 Point Correlation Functions (3/4 PCFs) in $\mathcal{O}(N_{\rm g} \log N_{\rm g})$ time using Fast Fourier Transforms (FFTs), with $N_{\rm g}$ the number of grid points…
Context. A novel high-performance exact pair counting toolkit called Fast Correlation Function Calculator (FCFC) is presented, which is publicly available at https://github.com/cheng-zhao/FCFC. Aims. As the rapid growth of modern…
We present the 2-point function from Fast and Accurate Spherical Bessel Transformation (2-FAST) algorithm for a fast and accurate computation of integrals involving one or two spherical Bessel functions. These types of integrals occur when…
Distance covariance and distance correlation have been widely adopted in measuring dependence of a pair of random variables or random vectors. If the computation of distance covariance and distance correlation is implemented directly…