Related papers: Fast n-point correlation functions and three-point…
Dust properties, such as mass and porosity, impact planet formation directly. Understanding the time evolution of dust distribution across multiple properties requires numerical computation. However, available ways to calculate the…
Conventional absolute camera pose via a Perspective-n-Point (PnP) solver often assumes that the correspondences between 2D image pixels and 3D points are given. When the correspondences between 2D and 3D points are not known a priori, the…
We present an $8.1\sigma$ detection of the non-Gaussian 4-Point Correlation Function (4PCF) using a sample of $N_{\rm g} \approx 8\times 10^5$ galaxies from the BOSS CMASS dataset. Our measurement uses the $\mathcal{O}(N_{\rm g}^2)$ NPCF…
An NP-hard problem is considered of intersecting a given set of $n$ straight line segments on the plane with the smallest cardinality set of disks of fixed radii $r>0,$ where the set of segments forms a straight line drawing $G=(V,E)$ of a…
We report a measurement of the large-scale 3-point correlation function of galaxies using the largest dataset for this purpose to date, 777, 202 Luminous Red Galaxies in the Sloan Digital Sky Survey Baryon Acoustic Oscillation Spectroscopic…
Higher-order lensing statistics contain a wealth of cosmological information that is not captured by second-order statistics. Stage-III lensing surveys have sufficient statistical power to significantly detect cumulant-based statistics up…
Multiparticle correlators are mathematical objects frequently encountered in quantum field theory and collider physics. By translating multiparticle correlators into the language of graph theory, we can gain new insights into their…
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 present a method for fast evaluation of the covariance matrix for a two-point galaxy correlation function (2PCF) measured with the Landy-Szalay estimator. The standard way of evaluating the covariance matrix consists in running the…
The shapes of galaxy N-point correlation functions can be used as standard rulers to constrain the distance-redshift relationship and thence the expansion rate of the Universe. The cosmological density fields traced by late-time galaxy…
We propose a fast approximate algorithm for large graph matching. A new projected fixed-point method is defined and a new doubly stochastic projection is adopted to derive the algorithm. Previous graph matching algorithms suffer from high…
We propose a method for computing n-time correlation functions of arbitrary spinorial, fermionic, and bosonic operators, consisting of an efficient quantum algorithm that encodes these correlations in an initially added ancillary qubit for…
We describe a simple and fast algorithm for identifying friends-of-friends features and prove its correctness. The algorithm avoids unnecessary expensive neighbor queries, uses minimal memory overhead, and rejects slowdown in high…
Analytical templates for the 4-Point Correlation Function (4PCF) covariance matrix have been developed in the past assuming a Gaussian Random Field (GRF). In this work, we present the second part of the beyond GRF calculation of the 4PCF…
We investigate the impact of baryonic feedback on two-point and three-point correlation functions (2PCFs and 3PCFs hereafter, respectively) involving galaxy density fields (g) and weak lensing shear fields (G), from simulated photometric…
The Stokeslet and stresslet kernels are commonly used in boundary element simulations and singularity methods for slow viscous flow. Evaluating the velocity induced by a collection of Stokeslets and stresslets by direct summation requires…
Computationally efficient classification system architecture is proposed. It utilizes fast tensor-vector multiplication algorithm to apply linear operators upon input signals . The approach is applicable to wide variety of recognition…
We present a spectrally accurate fast algorithm for evaluating the solution to the scalar wave equation in free space driven by a large collection of point sources in a bounded domain. With $M$ sources temporally discretized by $N_t$ time…
Recently there has been progress on the computation of two- and three-point correlation functions with two "heavy" states via semiclassical methods. We extend this analysis to the case of AdS_4 x CP^3, and examine the suggested procedure…
We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph, which are straightforward generalizations of strongly connected components. While in undirected graphs the 2-edge and…