Papers › Numerical implementation of the Cubic Galileon model in PINOCCHIO
Numerical implementation of the Cubic Galileon model in PINOCCHIO
Yanling Song, Chiara Moretti, Pierluigi Monaco, Bin Hu
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present a perturbative treatment of nonlinear galaxy clustering in the context of the cubic Galileon modified gravity model, in terms of 2nd order Lagrangian Perturbation theory and an extension of ellipsoidal collapse that includes Vainshtein screening. We numerically implement such prescriptions in the approximate PINOCCHIO code, and use it to generate realisations of the matter density field and halo catalogues with different prescriptions for ellipsoidal collapse. We investigate the impact of three different approximations in the computation of collapse times on the halo mass function, halo bias and matter power spectrum. In the halo mass function, both the modified gravity effect and the screening effect are significant in the high mass end, similar to what is found for other MG models. We perform a comparison with N-body simulations to assess the validity of our approach, and show that we can reproduce the same trend observed in simulations for all quantities considered. With a simple modification to the grouping algorithm of PINOCCHIO to take into account the gravity modification, and without the need to re-calibrate the algorithm, we show that we can reproduce the linear halo bias and the mildly-nonlinear matter power spectrum of simulations with good accuracy, especially for the implementation with Vainshtein screening. We stress that, while approximate, our method is orders of magnitude faster than a full N-body simulation, making it an optimal tool for the quick generation of large sets of halo catalogues for cosmological observables.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections