Bayesian Strong Gravitational-Lens Modeling on Adaptive Grids: Objective Detection of Mass Substructure in Galaxies

Authors: S. Vegetti (Kapteyn), L. V. E. Koopmans (Kapteyn)

arXiv: 0805.0201v2 - DOI (astro-ph)
21 pages, 15 figures, 4 tables; accepted for publication in MNRAS

Abstract: We introduce a new adaptive and fully Bayesian grid-based method to model strong gravitational lenses with extended images. The primary goal of this method is to quantify the level of luminous and dark-mass substructure in massive galaxies, through their effect on highly-magnified arcs and Einstein rings. The method is adaptive on the source plane, where a Delaunay tessellation is defined according to the lens mapping of a regular grid onto the source plane. The Bayesian penalty function allows us to recover the best non-linear potential-model parameters and/or a grid-based potential correction and to objectively quantify the level of regularization for both the source and the potential. In addition, we implement a Nested-Sampling technique to quantify the errors on all non-linear mass model parameters -- ... -- and allow an objective ranking of different potential models in terms of the marginalized evidence. In particular, we are interested in comparing very smooth lens mass models with ones that contain mass-substructures. The algorithm has been tested on a range of simulated data sets, created from a model of a realistic lens system. One of the lens systems is characterized by a smooth potential with a power-law density profile, twelve include a NFW dark-matter substructure of different masses and at different positions and one contains two NFW dark substructures with the same mass but with different positions. Reconstruction of the source and of the lens potential for all of these systems shows the method is able, in a realistic scenario, to identify perturbations with masses >=10^7 solar mass when located on the Einstein ring. For positions both inside and outside of the ring, masses of at least 10^9 solar mass are required (...).

Submitted to arXiv on 02 May. 2008

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.