A group finder algorithm optimised for the study of local galaxy environments

Journal article

Context. The majority of galaxy group catalogues available in the literature use the popular friends-of-friends algorithm which links galaxies using a linking length. One potential drawback to this approach is that clusters of points can be linked with thin bridges which may not be desirable. In order to study galaxy groups, it is important to obtain realistic group structures. Aim. Here we present a new simple group finder algorithm, TD-ENCLOSE

Authors: Graham, MT; Cappellari, M

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: EDP Sciences
• Journal: Astronomy & Astrophysics
• Volume: 675
• Pages: A161-A161
• Publication date: 2023-07-14
• Acceptance date: 2020-10-02
• DOI: 10.1051/0004-6361/201936851
• EISSN: 1432-0746
• ISSN: 0004-6361
• Language: English
• Keywords: Galaxy; Algorithm; Artificial intelligence; Galaxy cluster; Group (periodic table); Physics; Outlier; Astrophysics; Kernel (algebra); Smoothing; Statistics; Galaxy group; Mathematics; Combinatorics; Computer science