Related papers: Fast n-point correlation functions and three-point…
We give an algorithm to compute $N$ steps of a convolution quadrature approximation to a continuous temporal convolution using only $O(N \log N)$ multiplications and $O(\log N)$ active memory. The method does not require evaluations of the…
We investigate correlation functions in a periodic box-ball system. For the second and the third nearest neighbor correlation functions, we give explicit formulae obtained by combinatorial methods. A recursion formula for a specific…
We propose three fast algorithms for solving the inverse problem of the thermoacoustic tomography corresponding to certain acquisition geometries. Two of these methods are designed to process the measurements done with point-like detectors…
We show that there is a polynomial space algorithm that counts the number of perfect matchings in an $n$-vertex graph in $O^*(2^{n/2})\subset O(1.415^n)$ time. ($O^*(f(n))$ suppresses functions polylogarithmic in $f(n)$).The previously…
A three-point iterative method for solving scalar non-linear equations was selected and then adapted to solve systems of non-linear equations. Subsequently, by applying Taylor's theorem to functions of $\R^{n}$ in $\R^{n}$, it is shown that…
We discuss and compare the efficiency of various methods, combinations of point-to-all propagators, stochastic timeslice-to-all propagators, the one-end trick and sequential propagators, to compute two-point correlation functions of…
We study the statistics of weak lensing convergence peaks, such as their abundance and two-point correlation function (2PCF), for a wide range of cosmological parameters $\Omega_m$ and $\sigma_8$ within the standard $\Lambda$CDM paradigm,…
In the framework of the functional renormalization group (FRG) we present a simple truncation scheme for the computation of real-time mesonic n-point functions, consistent with the derivative expansion of the effective action. Via analytic…
The tree code for the approximate evaluation of gravitational forces is extended and substantially accelerated by including mutual cell-cell interactions. These are computed by a Taylor series in Cartesian coordinates and in a completely…
This paper presents constant-time and near-constant-time distributed algorithms for a variety of problems in the congested clique model. We show how to compute a 3-ruling set in expected $O(\log \log \log n)$ rounds and using this, we…
We perform Monte Carlo calculation of correlation functions in 4d N=4 super Yang-Mills theory on R*S^3 in the planar limit. In order to circumvent the well-known problem of lattice SUSY, we adopt the idea of a novel large-N reduction, which…
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…
We experimentally measured higher order normalized correlation functions (nCF) of pulsed light with a time-multiplexing-detector. We demonstrate excellent performance of our device by verifying unity valued nCF up to the eighth order for…
In this article, we present an $O(N \log N)$ rapidly convergent algorithm for the numerical approximation of the convolution integral with radially symmetric weakly singular kernels and compactly supported densities. To achieve the reduced…
Cosmological simulations are useful tools for studying the evolution of galaxies, and it is critical to accurately identify galaxies and their halos from raw simulation data. The friends-of-friend (FoF) algorithm has been widely adopted for…
We analyze the 2-point correlation function (2PCF) of galaxy groups identified from the 2-degree Field Galaxy Redshift Survey with the halo based group finder recently developed by Yang et al (2004b). With this group catalogue we are able…
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…
To make use of clustering statistics from large cosmological surveys, accurate and precise covariance matrices are needed. We present a new code to estimate large scale galaxy two-point correlation function (2PCF) covariances in arbitrary…
We examine the light-cone effect on the two-point correlation functions using numerical simulations for the first time. Specifically, we generate several sets of dark matter particle distributions on the light-cone up to z=0.4 and z=2 over…
Context. A novel high-performance exact pair counting toolkit called Fast Correlation Function Calculator (FCFC) is presented, which is publicly available at https://github.com/cheng-zhao/FCFC. Aims. As the rapid growth of modern…