The CluMPR Galaxy Cluster-Finding Algorithm and DESI Legacy Survey Galaxy Cluster Catalogue

Authors: M. J. Yantovski-Barth, Jeffrey A. Newman, Biprateep Dey, Brett H. Andrews, Michael Eracleous, Jesse Golden-Marx, Rongpu Zhou

arXiv: 2307.10426v1 - DOI (astro-ph.CO)
20 pages, 26 figures, to be submitted to MNRAS
License: CC BY 4.0

Abstract: Galaxy clusters enable unique opportunities to study cosmology, dark matter, galaxy evolution, and strongly-lensed transients. We here present a new cluster-finding algorithm, CluMPR (Clusters from Masses and Photometric Redshifts), that exploits photometric redshifts (photo-z's) as well as photometric stellar mass measurements. CluMPR uses a 2-dimensional binary search tree to search for overdensities of massive galaxies with similar redshifts on the sky and then probabilistically assigns cluster membership by accounting for photo-z uncertainties. We leverage the deep DESI Legacy Surveys grzW1W2 imaging over one-third of the sky to create a catalogue of ~ 300,000 galaxy cluster candidates out to z = 1, including tabulations of member galaxies and estimates of each cluster's total stellar mass. Compared to other methods, CluMPR is particularly effective at identifying clusters at the high end of the redshift range considered (z = 0.75-1), with minimal contamination from low-mass groups. These characteristics make it ideal for identifying strongly lensed high-redshift supernovae and quasars that are powerful probes of cosmology, dark matter, and stellar astrophysics. As an example application of this cluster catalogue, we present a catalogue of candidate wide-angle strongly-lensed quasars in Appendix C. The five best candidates identified from this sample include two known lensed quasar systems and a possible changing-look lensed QSO with SDSS spectroscopy. All code and catalogues produced in this work are publicly available (see Data Availability).

Submitted to arXiv on 19 Jul. 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.