Abstract

We apply two compression methods to the galaxy power spectrum monopole/quadrupole and bispectrum monopole measurements from the Baryon Oscillation Spectroscopic Survey DR12 CMASS sample. Both methods reduce the dimension of the original data vector to the number of cosmological parameters considered, using the Karhunen–Loève (KL) algorithm with an analytic covariance model. In the first case, we infer the posterior through Markov chain Monte Carlo (MCMC) sampling from the likelihood of the compressed data vector (MC–KL). The second, faster option, works by first Gaussianizing and then orthogonalizing the parameter space before the compression; in this option (G-PCA) we only need to run a low-resolution preliminary MCMC sample for the Gaussianization to compute our posterior. Both compression methods accurately reproduce the posterior distributions obtained by standard MCMC sampling on the CMASS data set for a k-space range of |$0.03\text{--}0.12\, h\, \mathrm{Mpc}^{-1}$|⁠. The compression enables us to increase the number of bispectrum measurements by a factor of ∼23 over the standard binning (from 116 to 2734 triangle bins used), which is otherwise limited by the number of mock catalogues available. This reduces the |$68{{\ \rm per\ cent}}$| credible intervals for the parameters (b1, b2, f, σ8) by (⁠|$-24.8{{\ \rm per\ cent}},-52.8{{\ \rm per\ cent}},-26.4{{\ \rm per\ cent}},-21{{\ \rm per\ cent}}$|⁠), respectively. Using these methods for future redshift surveys such as DESI, Euclid, and PFS will drastically reduce the number of simulations needed to compute accurate covariance matrices and will facilitate tighter constraints on cosmological parameters.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.