相关论文: Fast n-point correlation functions and three-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…
We present a new algorithm for efficiently computing the $N$-point correlation functions (NPCFs) of a 3D density field for arbitrary $N$. This can be applied both to a discrete spectroscopic galaxy survey and a continuous field. By…
The three-point correlation function (3PCF) of a weak lensing shear field contains information that is complementary to that in the two-point correlation function (2PCF), which can help improve the cosmological parameters and calibrate…
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…
We present efficient algorithms for computing the $N$-point correlation functions (NPCFs) of random fields in arbitrary $D$-dimensional homogeneous and isotropic spaces. Such statistics appear throughout the physical sciences, and provide a…
The nature of dark energy and the complete theory of gravity are two central questions currently facing cosmology. A vital tool for addressing them is the 3-point correlation function (3PCF), which probes deviations from a spatially random…
We present an algorithm enabling computation of the anisotropic redshift-space galaxy 3-point correlation function (3PCF) scaling as $N^2$, with $N$ the number of galaxies. Our previous work showed how to compute the isotropic 3PCF with…
This article provides a method for quick computation of galaxy two-point correlation function(2pCF) from redshift surveys using python. One of the salient features of this approach is that it can be used for calculating galaxy clustering…
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…
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…
As we move towards future galaxy surveys, the three-point statistics will be increasingly leveraged to enhance the constraining power of the data on cosmological parameters. An essential part of the three-point function estimation is…
The 3-Point Correlation Function (3PCF), which measures correlations between triplets of galaxies encodes information about peculiar velocities, which distort the observed positions of galaxies along the line of sight away from their true…
We develop, implement and test a set of algorithms for estimating N-point correlation functions from pixelized sky maps. These algorithms are slow, in the sense that they do not break the O(N_pix^N) barrier, and yet, they are fast enough…
N-Point Correlation Functions, usually with N = 2, 3, and their Fourier-space analogs power spectrum and bispectrum, are major tools used in cosmology to capture the clustering of large-scale structure. We outline how the clustering these…
The self-energy of the critical 3-dimensional O(N) model is calculated. The analysis is performed in the context of the Non-Perturbative Renormalization Group, by exploiting an approximation which takes into account contributions of an…
Two-point correlation functions (2PCF) are widely used to characterize how points cluster in space. In this work, we study the problem of measuring the 2PCF over a large set of points, restricted to a subset satisfying a property of…
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 an algorithm for the fast computation of the general $N$-point spatial correlation functions of any discrete point set embedded within an Euclidean space of $\mathbb{R}^n$. Utilizing the concepts of kd-trees and graph databases,…
The two-point correlation function (2PCF) is the most widely used tool for quantifying the spatial distribution of galaxies. Since the distribution of galaxies is determined by galaxy formation physics as well as the underlying cosmology,…
The three-point correlation function (3PCF) can now be measured in large galaxy redshift surveys, but in three dimensions its interpretation is complicated by the presence of redshift-space distortions. I investigate the projected 3PCF,…