Related papers: Computing 3 point correlation function randoms cou…
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…
Higher-order statistics are a useful and complementary tool for measuring the clustering of galaxies, containing information on the non-gaussian evolution and morphology of large-scale structure in the Universe. In this work we present…
We explore the enhanced self-calibration of photometric galaxy redshift distributions, $n(z)$, through the combination of up to six two-point functions. Our $\rm 3\times2pt$ configuration is comprised of photometric shear, spectroscopic…
The number of triangles is a computationally expensive graph statistic which is frequently used in complex network analysis (e.g., transitivity ratio), in various random graph models (e.g., exponential random graph model) and in important…
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…
In this work, which is the first of a series to prepare a cosmological parameter analysis with third-order cosmic shear statistics, we model both the shear three-point correlation functions $\Gamma^{(i)}$ and the third-order aperture…
Using the pair-count implementaion from the Corrfunc package we show that with a low discrepency sequence we can calculate the two-point correlation function more accurately than with random points at no extra computational cost.
Graphs are used to model interactions in a variety of contexts, and there is a growing need to quickly assess the structure of such graphs. Some of the most useful graph metrics are based on triangles, such as those measuring social…
We present FuGa3D, a code for fast computation of correlation functions and power spectra for galaxy survey observables, including galaxy clustering and cosmic shear. We define the redshift-space correlation function (RCF) as the…
The analytic structure of elementary correlation functions of a quantum field is relevant for the calculation of masses of bound states and their time-like properties in general. In quantum chromodynamics, the calculation of correlation…
There is a trivial $O(\frac{n^3}{T})$ time algorithm for approximate triangle counting where $T$ is the number of triangles in the graph and $n$ the number of vertices. At the same time, one may count triangles exactly using fast matrix…
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…
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,…
We present an improved method for calculating the parallel and perpendicular velocity correlation functions directly from peculiar velocity surveys using weighted maximum-likelihood estimators. A central feature of the new method is the use…
We present measurements of the redshift--space three-point correlation function of galaxies in the Sloan Digital Sky Survey (SDSS). For the first time, we analyze the dependence of this statistic on galaxy morphology, color and luminosity.…
Building on previous developments of a harmonic decomposition framework for computing the three-point correlation function (3PCF) of projected scalar fields over the sky, this work investigates how much cosmological information is contained…
We use the halo model of clustering to compute two- and three-point correlation functions for weak lensing, and apply them in a new statistical technique to measure properties of massive halos. We present analytical results on the eight…
We present a collection of new results on problems related to 3SUM, including: 1. The first truly subquadratic algorithm for $\ \ \ \ \ $ 1a. computing the (min,+) convolution for monotone increasing sequences with integer values bounded by…
We study the optimal use of third order statistics in the analysis of weak lensing by large-scale structure. These higher order statistics have long been advocated as a powerful tool to break measured degeneracies between cosmological…
We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query…