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

结合FOF和基于晕的算法识别星系群

Combining FOF and halo-based algorithms for the identification of galaxy groups

Facundo Rodriguez, Manuel Merchán

摘要:

星系群为各种各样的研究提供了手段,有助于更好地了解大尺度宇宙的结构,并使星系的性质与宿主晕的性质联系起来。然而,星系系统的识别是一项具有挑战性的任务,因此有必要尽可能地改进所涉及的技术。鉴于目前和即将到来的大型星系目录,我们提出,实施和评估的算法,结合了两个最流行的技术来识别星系系统。该算法可以很容易地应用于任何光谱星系目录,但在这里,我们证明了它的使用斯隆数字巡天。假设一个星系群是一个引力约束系统,至少有一个明亮的星系,我们开始识别组与朋友的友谊算法适应这个定义。鉴于这种方法的缺点,特别是缺乏识别低数量组的能力,因此无法在整个质量范围内研究晕的占用,我们通过添加基于晕的程序来改进它。为了评估性能,我们构建了一个模拟目录,从半分析模型比较使用我们的方法与从模拟中获得的组。使用我们的方法提取的组与那些模拟目录的比较表明,所提出的算法提供了优异的结果。在程序的第一部分中,对朋友圈算法进行了修改,以适应所采用的组定义,从而得到了可靠的组。此外,基于晕的方法的结合减少了闯入者,同时更准确地再现了每组星系的数量。作为一个具体的应用,我们使用该算法提取组从斯隆数字巡天。

英文摘要:

Galaxy groups provide the means for a great diversity of studies that contribute to a better understanding of the structure of the universe on a large scale and allow the properties of galaxies to be linked to those of the host halos. However, the identification of galaxy systems is a challenging task and therefore it is necessary to improve the techniques involved as much as possible. In view of the large present and forthcoming galaxy catalogues, we propose, implement, and evaluate an algorithm that combines the two most popular techniques used to identify galaxy systems. The algorithm can be easily applied to any spectroscopic galaxy catalogue, but here we demonstrate its use on the Sloan Digital Sky Survey. Assuming that a galaxy group is a gravitationally bounded system that has at least one bright galaxy, we begin by identifying groups with a Friends-Of-Friends algorithm adapted to fit this definition. In view of the shortcomings of this method, particularly the lack of ability to identify low-number groups, and consequently the inability to study the occupation of halos throughout the mass range, we improve it by adding a halo-based procedure. To assess the performance, we construct a mock catalogue from a semi-analytical model to compare the groups identified using our method with those obtained from the simulation. The comparison of groups extracted using our method with those of a mock catalogue shows that the proposed algorithm provides excellent results. The modifications introduced to the Friends-Of-Friends algorithm in the first part of the procedure to fit the adopted group definition gave reliable groups. Furthermore, the incorporation of the halo-based method reduces the interlopers while more accurately reproducing the number of galaxies per group. As a specific application, we use the algorithm to extract groups from the Sloan Digital Sky Survey.

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

↑