Related papers: Fast n-point correlation functions and three-point…
We present a computational framework for piecewise constant functions (PCFs) and use this for several types of computations that are useful in statistics, e.g., averages, similarity matrices, and so on. We give a linear-time,…
In Constrained Correlation Clustering, the goal is to cluster a complete signed graph in a way that minimizes the number of negative edges inside clusters plus the number of positive edges between clusters, while respecting hard constraints…
In this paper, we present a new hybrid algorithm for the time integration of collisional N-body systems. In this algorithm, gravitational force between two particles is divided into short-range and long-range terms, using a…
We present a survey of the cosmological applications of the next generation of weak lensing surveys, paying special attention to the computational challenges presented by the number of galaxies, $N_{gal} ~$ 10$^{5}$. We focus on optimal…
The $N$-point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computational complexity of the DFT a critical performance indicator to…
We study the forrelation problem: given a pair of $n$-bit Boolean functions $f$ and $g$, estimate the correlation between $f$ and the Fourier transform of $g$. This problem is known to provide the largest possible quantum speedup in terms…
Recently constructed gravity solutions with Schrodinger symmetry provide a new example of AdS/CFT-type dualities for the type of non-relativistic field theories relevant to certain cold atom systems. In this paper we use the gravity side to…
The calculation of dynamic response functions is expected to be an early application benefiting from rapidly developing quantum hardware resources. The ability to calculate real-time quantities of strongly-correlated quantum systems is one…
The 2-point spatial correlation function (CF), $\xi(s)$, has been used to study the clustering of the galaxies in the preliminary version of the HIPASS Bright Galaxy Catalogue (HIPASS BGC), which includes the 1,000 HI brightest galaxies in…
An algorithm is developed for efficiently constructing the Lorentz covariant effective three-point vertices of the decay of a particle into two daughter particles in which all the masses and spins of the three particles can be arbitrary.…
In this work, we have explored the advantages and drawbacks of using GPUs instead of CPUs in the calculation of a standard 2-point correlation function algorithm, which is useful for the analysis of Large Scale Structure of galaxies. Taking…
In a detailed analysis of the three point correlation function (3PCF) for the 2dF Galaxy Redshift Survey we have accurately measured the 3PCF for galaxies of different luminosity. The 3PCF amplitudes [$\Qsu$ or $\Qrpu$] of the galaxies…
The massive quantities of genomic data being made available through gene sequencing techniques are enabling breakthroughs in genomic science in many areas such as medical advances in the diagnosis and treatment of diseases. Analyzing this…
We investigate the accuracy and range of validity of the perturbative model for the 2-point (2PCF) and 3-point (3PCF) correlation functions in real space in view of the forthcoming analysis of the Euclid mission spectroscopic sample. We…
This paper revisits the problem of computing empirical cumulative distribution functions (ECDF) efficiently on large, multivariate datasets. Computing an ECDF at one evaluation point requires $\mathcal{O}(N)$ operations on a dataset…
Kernel matrices appear in machine learning and non-parametric statistics. Given $N$ points in $d$ dimensions and a kernel function that requires $\mathcal{O}(d)$ work to evaluate, we present an $\mathcal{O}(dN\log N)$-work algorithm for the…
I present a new algorithm, CALCLENS, for efficiently computing weak gravitational lensing shear signals from large N-body light cone simulations over a curved sky. This new algorithm properly accounts for the sky curvature and boundary…
We propose faster algorithms for the following three optimization problems on $n$ collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in higher dimensions. 1- Maximizing total area of disjoint…
We calculate the normalized angular three-point correlation function (3PCF), $q$, as well as the normalized angular skewness, $s_3$, assuming the small-angle approximation, for a biased mass distribution in flat and open cold-dark-matter…
The inverse source problem arising in photoacoustic tomography and in several other coupled-physics modalities is frequently solved by iterative algorithms. Such algorithms are based on the minimization of a certain cost functional. In…