Papers › Statistical strong lensing. III. Inferences with complete samples of lenses
Statistical strong lensing. III. Inferences with complete samples of lenses
Alessandro Sonnenfeld
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.
Context. Existing samples of strong lenses have been assembled by giving priority to sample size, at the cost of having a complex selection function. With the advent of the next generation of wide-field photometric surveys, however, it might become possible to identify subsets of the lens population with well-defined selection criteria, trading sample size for completeness. Aims. There are two main advantages of working with a complete sample of lenses. First, it is possible to recover the properties of the general population of galaxies, of which strong lenses are a biased subset. Second, the relative number of lenses and non-detections can be used to further constrain models of galaxy structure. This work illustrates how to carry out a statistical strong lensing analysis that takes advantage of these features. Methods. I introduced a general formalism for the statistical analysis of a sample of strong lenses with known selection function, then tested it on simulated data. The simulation consists of a population of 10⁵ galaxies with an axisymmetric power-law density profile, a population of background point sources, and a subset of ∼10³ strong lenses, complete above an observational cut. Mandatory. The method allows to recover the distribution in Einstein radius and mass density slope of the galaxy population in an unbiased way. The number of non-lenses helps to constrain the model when magnification data are not available. Conclusions. Complete samples of lenses are a powerful asset to turn precise strong lensing measurements into accurate statements on the properties of the general galaxy population.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
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