An analytic implementation of the IR-resummation for the BAO peak
Matthew Lewandowski, Leonardo Senatore
TL;DR
This paper introduces a fully analytic implementation of IR-resummation for the BAO peak within the EFTofLSS, leveraging FFTLog to decompose the linear power spectrum into complex power laws and performing analytic one-loop integrals. The authors derive explicit tree-level and one-loop resummed expressions for the correlation function, expressible as sums over cosmology-dependent coefficients and fixed analytic kernels, with three practical evaluation strategies: exact evaluation, saddle-point approximation, and a fixed-displacements fast approximation. The analytic method achieves sub-percent accuracy (≈0.2%) relative to standard numerical integration while delivering substantial speedups (≈6–10× when using fixed displacements) and is generalizable to higher loops. The results, validated against Dark Sky simulations, demonstrate accurate BAO reconstruction and robust applicability to data-driven cosmological parameter fitting, with potential extensions to the bispectrum and redshift-space distortions.
Abstract
We develop an analytic method for implementing the IR-resummation of arXiv:1404.5954, which allows one to correctly and consistently describe the imprint of baryon acoustic oscillations (BAO) on statistical observables in large-scale structure. We show that the final IR-resummed correlation function can be computed analytically without relying on numerical integration, thus allowing for an efficient and accurate use of these predictions on real data in cosmological parameter fitting. In this work we focus on the one-loop correlation function and the BAO peak. We show that, compared with the standard numerical integration method of IR-resummation, the new method is accurate to better than 0.2 %, and is quite easily improvable. We also give an approximate resummation scheme which is based on using the linear displacements of a fixed fiducial cosmology, which when combined with the method described above, is about six times faster than the standard numerical integration. Finally, we show that this analytic method is generalizable to higher loop computations.
