arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.04707astro-ph.CO
收藏

欧几里得制备III。广测光中的星系团探测、性能及算法选择

Euclid preparation III. Galaxy cluster detection in the wide photometric survey, performance and algorithm selection

Euclid Collaboration, R. Adam, M. Vannier, S. Maurogordato, A. Biviano, C. Adami, B. Ascaso, F. Bellagamba, C. Benoist, A. Cappi, A. Díaz-Sánchez, F. Durret, S.… 展开作者

Euclid Collaboration, R. Adam, M. Vannier, S. Maurogordato, A. Biviano, C. Adami, B. Ascaso, F. Bellagamba, C. Benoist, A. Cappi, A. Díaz-Sánchez, F. Durret, S. Farrens, A. H. Gonzalez, A. Iovino, R. Licitra, M. Maturi, S. Mei, A. Merson, E. Munari, R. Pelló, M. Ricci, P. F. Rocci, M. Roncarelli, F. Sarron, Y. Amoura, S. Andreon, N. Apostolakos, M. Arnaud, S. Bardelli, J. Bartlett, C. M. Baugh, S. Borgani, M. Brodwin, F. Castander, G. Castignani, O. Cucciati, G. De Lucia, P. Dubath, P. Fosalba, C. Giocoli, H. Hoekstra, G. A. Mamon, J. B. Melin, L. Moscardini, S. Paltani, M. Radovich, B. Sartoris, M. Schultheis, M. Sereno, J. Weller, C. Burigana, C. S. Carvalho, L. Corcione, H. Kurki-Suonio, P. B. Lilje, G. Sirri, R. Toledo-Moreo, G. Zamorani

摘要:

星系团在质量和红移的箱计数已被证明是一个有竞争力的探针,以检验宇宙学模型。这种方法需要一个有效的盲检测的集群从一个众所周知的选择功能和强大的质量估计调查。欧几里德广域巡天将在光学和近红外波段覆盖15000度的$^2$,在$H$波段覆盖24等。由此产生的数据将有可能探测到大量的星系团,这些星系团的质量范围很广,最高可达红移$\sim 2$。本文介绍了欧几里德集群挑战赛(CFC)的最终结果。这些挑战的目的是选择最符合欧几里得任务要求的聚类检测算法。最后的CFC包括六个独立的检测算法,基于不同的技术,如光度红移层析成像,最佳滤波,分层方法,小波和朋友的朋友算法。这些算法被盲目地应用到一个模拟的星系目录具有代表性的欧几里德性质。算法的相对性能通过将所得检测与模拟中的已知聚类相匹配来评估。对几种匹配程序进行了检测,从而可以估计对完整性的相关系统性影响至$<3$ %。所有测试的算法是非常有竞争力的性能方面,其中三个达到$>80$ %完整性的平均纯度为80%,低至质量的$10^{14}$ M $_{\odot}$和高达红移$z=2$。基于这些结果,两个算法被选择来实现在欧几里得流水线,AMICO码,基于匹配滤波,和PZWav码,基于自适应小波方法。[删节]

英文摘要:

Galaxy cluster counts in bins of mass and redshift have been shown to be a competitive probe to test cosmological models. This method requires an efficient blind detection of clusters from surveys with a well-known selection function and robust mass estimates. The Euclid wide survey will cover 15000 deg$^2$ of the sky in the optical and near-infrared bands, down to magnitude 24 in the $H$-band. The resulting data will make it possible to detect a large number of galaxy clusters spanning a wide-range of masses up to redshift $\sim 2$. This paper presents the final results of the Euclid Cluster Finder Challenge (CFC). The objective of these challenges was to select the cluster detection algorithms that best meet the requirements of the Euclid mission. The final CFC included six independent detection algorithms, based on different techniques, such as photometric redshift tomography, optimal filtering, hierarchical approach, wavelet and friend-of-friends algorithms. These algorithms were blindly applied to a mock galaxy catalog with representative Euclid-like properties. The relative performance of the algorithms was assessed by matching the resulting detections to known clusters in the simulations. Several matching procedures were tested, thus making it possible to estimate the associated systematic effects on completeness to $<3$%. All the tested algorithms are very competitive in terms of performance, with three of them reaching $>80$% completeness for a mean purity of 80% down to masses of $10^{14}$ M$_{\odot}$ and up to redshift $z=2$. Based on these results, two algorithms were selected to be implemented in the Euclid pipeline, the AMICO code, based on matched filtering, and the PZWav code, based on an adaptive wavelet approach. [abridged]

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑