Related papers: Fast n-point correlation functions and three-point…
We present approximation algorithms for the following NP-hard optimization problems related to bottleneck spanning trees in metric spaces. 1. The disjoint bottleneck spanning tree problem: Given $n$ pairs of points in a metric space, find…
Higher order statistics are investigated in ($\Omega$)CDM universes by analyzing $500\mpc$ high resolution tree N-body simulations with both $\Omega = 1$, and $\Omega < 1$. The amplitudes of the N-point correlation functions are calculated…
The fully general calculation of the cosmic error on N-point correlation functions and related quantities is presented. More precisely, the variance caused by the finite volume, discreteness, and edge effects is determined for {\em any}…
We present new measurements of the redshift-space three-point correlation function (3PCF) of Luminous Red Galaxies (LRGs) from the Sloan Digital Sky Survey (SDSS). Using the largest dataset to date, the Data Release 7 (DR7) LRGs, and an…
Calculating the correlation in a sliding window is a common method of statistical evaluation of the interconnect between two sets of data. And although the calculation of a single correlation coefficient is not resource-intensive and…
We present a new method for computing the Near-To-Far-Field (NTFF) transformation in FDTD simulations which has an overall scaling of $O(N^3)$ instead of the standard $O(N^4)$. By mapping the far field with a cartesian coordinate system the…
Cosmological perturbation theory is a powerful tool to predict the statistics of large-scale structure in the weakly non-linear regime, but even at 1-loop order it results in computationally expensive mode-coupling integrals. Here we…
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…
We present the integrated 3-point shear correlation function $i\zeta_{\pm}$ -- a higher-order statistic of the cosmic shear field -- which can be directly estimated in wide-area weak lensing surveys without measuring the full 3-point shear…
We present four novel approximation algorithms for finding triangulation of minimum treewidth. Two of the algorithms improve on the running times of algorithms by Robertson and Seymour, and Becker and Geiger that approximate the optimum by…
We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of $n$ items and that the available workspace is $\Theta(s)$ bits, where $\lg n \leq s \leq n…
In recent years there has been a renewed interest in finding fast algorithms to compute accurately the linear canonical transform (LCT) of a given function. This is driven by the large number of applications of the LCT in optics and signal…
In this paper, we present a new exact algorithm for counting perfect matchings, which relies on neither inclusion-exclusion principle nor tree-decompositions. For any bipartite graph of $2n$ nodes and $\Delta n$ edges such that $\Delta \geq…
Analytical templates for the covariance matrix of the 4-Point Correlation Function (4PCF) have been developed in the past assuming a Gaussian Random Field (GRF). In this work, we present the first non-Gaussian calculation of the 4PCF…
Correlation functions measured as a function of $\Delta \eta, \Delta \phi$ have emerged as a powerful tool to study the dynamics of particle production in nuclear collisions at high energy. They are however subject, like any other…
Classical density functional theory (DFT) of fluids is a valuable tool to analyze inhomogeneous fluids. However, few numerical solution algorithms for three-dimensional systems exist. Here we present an efficient numerical scheme for fluids…
We study various correlation functions (two and three point functions) in a large $N$ matrix model of six commuting matrices with a numerical Monte Carlo algorithm. This is equivalent to a model of a gas of particles in six dimensions with…
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…
In the advent of new large galaxy surveys, which will produce enormous datasets with hundreds of millions of objects, new computational techniques are necessary in order to extract from them any two-point statistic, the computational time…
Two-point correlation functions are ubiquitous tools of modern cosmology, appearing in disparate topics ranging from cosmological inflation to late-time astrophysics. When the background spacetime is maximally symmetric, invariance…