paper

Efficient Computation of -point Correlation Functions in Dimensions

arXiv:2106.10278 · doi:10.1073/pnas.2111366119

Abstract

We present efficient algorithms for computing the -point correlation functions (NPCFs) of random fields in arbitrary -dimensional homogeneous and isotropic spaces. Such statistics appear throughout the physical sciences, and provide a natural tool to describe stochastic processes. algorithms for computing the NPCF components have complexity (for a data set containing particles); their application is thus computationally infeasible unless is small. By projecting the statistic onto a suitably-defined angular basis, we show that the estimators can be written in a separable form, with complexity , or if evaluated using a Fast Fourier Transform on a grid of size . Our decomposition is built upon the -dimensional hyperspherical harmonics; these form a complete basis on the -sphere and are intrinsically related to angular momentum operators. Concatenation of such harmonics gives states of definite combined angular momentum, forming a natural separable basis for the NPCF. As and grow, the number of basis components quickly becomes large, providing a practical limitation to this (and all other) approaches: however, the dimensionality is greatly reduced in the presence of symmetries; for example, isotropic correlation functions require only states of zero combined angular momentum. We provide a \textsc{Julia} package implementing our estimators, and show how they can be applied to a variety of scenarios within cosmology and fluid dynamics. The efficiency of such estimators will allow higher-order correlators to become a standard tool in the analysis of random fields.

12 pages, 3 figures, accepted by PNAS. Code available at https://github.com/oliverphilcox/NPCFs.jl

References in corpus (5)

Cited by in corpus (8)