Related papers: Fast Algorithms and Efficient Statistics: N-point …
This paper presents new and efficient algorithms for matching stellar catalogues where the transformation between the coordinate systems of the two catalagoues is unknown and may include shearing. Finding a given object whether a star or…
Efficient index structures for fast approximate nearest neighbor queries are required in many applications such as recommendation systems. In high-dimensional spaces, many conventional methods suffer from excessive usage of memory and slow…
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…
The 2-point correlation function of the galaxy spatial distribution is a major cosmological observable that enables constraints on the dynamics and geometry of the Universe. The Euclid mission aims at performing an extensive spectroscopic…
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the…
Calculating the values of nuclear correlation functions is computationally intensive due to the fact that the number of terms in a nuclear wave function scales exponentially with atomic number. To speed up this computation, we represent a…
We propose a self-contained and accessible derivation of an exact formula for the $n$-point correlation functions of the signal measured when continuously observing a quantum system. The expression depends on the initial quantum state and…
Spatial data fusion is a bottleneck when it meets the scale of 10 billion records. Cross-matching celestial catalogs is just one example of this. To challenge this, we present a framework that enables efficient cross-matching using Learned…
We introduce fast algorithms for correlation clustering with respect to the Min Max objective that provide constant factor approximations on complete graphs. Our algorithms are the first purely combinatorial approximation algorithms for…
One of the main obstacles for the signal extraction of the three point correlation function using photometric surveys, such as the Rubin Observatory Legacy Survey of Space and Time (LSST), will be the prohibitive computation time required…
Change-point analysis is thriving in this big data era to address problems arising in many fields where massive data sequences are collected to study complicated phenomena over time. It plays an important role in processing these data by…
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…
High order correlations in the cosmic matter density have become increasingly valuable in cosmological analyses. However, computing such correlation functions is computationally expensive. We aim to circumvent these challenges by designing…
Recent technological advances have led to a flood of new data on cosmology rich in information about the formation and evolution of the universe, e.g., the data collected in Sloan Digital Sky Survey (SDSS) for more than 200 million objects.…
A class of improved estimators is proposed for N-point correlation functions of galaxy clustering, and for discrete spatial random processes in general. In the limit of weak clustering, the variance of the unbiased estimator converges to…
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…
In astronomy and cosmology, significant effort is devoted to characterizing and understanding spatial cross-correlations between points - e.g. galaxy positions, high energy neutrino arrival directions, X-ray and AGN sources, and continuous…
We study the flat-sky approximation for galaxy number counts including relativistic effects, and assess its performance and accuracy with respect to the full-sky result. We find an agreement of up to 5% for the local and lensing…
We introduce a novel strategy for cosmological Boltzmann codes leading to an increase in speed by a factor of \sim 30 for small scale Fourier modes. We (re-)investigate the tight coupling approximation and obtain analytic formulae reaching…
Motivated by the results presented in a companion paper, here we give a simple analytical expression for the matter n-point functions in the Zel'dovich approximation (ZA) both in real and in redshift space (including the angular case). We…