Revisiting Vainshtein Screening for fast N-body simulations

Authors: Guilherme Brando, Kazuya Koyama, Hans A. Winther

arXiv: 2303.09549v1 - DOI (astro-ph.CO)
33 pages, 13 figures and 9 tables
License: CC BY 4.0

Abstract: We revisit a method to incorporate the Vainshtein screening mechanism in N-body simulations proposed by R. Scoccimarro in~\cite{Scoccimarro:2009eu}. We further extend this method to cover a subset of Horndeski theories that evade the bound on the speed of gravitational waves set by the binary neutron star merger GW170817. The procedure consists of the computation of an effective gravitational coupling that is time and scale dependent, $G_{\rm eff}\left(k,z\right)$, where the scale dependence will incorporate the screening of the fifth-force. This is a fast procedure that when contrasted to the alternative of solving the full equation of motion for the scalar field inside N-body codes, reduces considerably the computational time and complexity required to run simulations. To test the validity of this approach in the non-linear regime, we have implemented it in a COmoving Lagrangian Approximation (COLA) N-body code, and ran simulations for two gravity models that have full N-body simulation outputs available in the literature, nDGP and Cubic Galileon. We validate the combination of the COLA method with this implementation of the Vainshtein mechanism with full N-body simulations for predicting the boost function: the ratio between the modified gravity non-linear matter power spectrum and its General Relativity counterpart. This quantity is of great importance for building emulators in beyond-$\Lambda$CDM models, and we find that the method described in this work has an agreement of below $2\%$ for scales down to $k \approx 3h/$Mpc with respect to full N-body simulations.

Submitted to arXiv on 16 Mar. 2023

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.