Combining friend-of-friend and halo-based algorithms for the identification of galaxy groups
- Autores
- Rodriguez, Facundo; Merchan, Manuel Enrique
- Año de publicación
- 2020
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- Galaxy groups provide the means for a great diversity of studies that contribute to a better understanding of the structure ofthe universe on a large scale and allow the properties of galaxies to be linked to those of the host halos. However, the identification ofgalaxy systems is a challenging task and therefore it is necessary to improve the techniques involved as much as possible.Aims. 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 spectroscopicgalaxy catalogue, but here we demonstrate its use on the Sloan Digital Sky Survey.Methods. 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, particularlythe lack of ability to identify low-number groups, and consequently the inability to study the occupation of halos throughout the massrange, we improve it by adding a halo-based procedure. To assess the performance, we construct a mock catalogue from a semianalytical model to compare the groups identified using our method with those obtained from the simulation.Results. The comparison of groups extracted using our method with those of a mock catalogue shows that the proposed algorithmprovides excellent results. The modifications introduced to the friends-of-friends algorithm in the first part of the procedure to fit theadopted group definition gave reliable groups. Furthermore, incorporation of the halo-based method reduces the interlopers whilemore accurately reproducing the number of galaxies per group. As a specific application, we use the algorithm to extract groups fromthe Sloan Digital Sky Survey
Fil: Rodriguez, Facundo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Astronomía Teórica y Experimental. Universidad Nacional de Córdoba. Observatorio Astronómico de Córdoba. Instituto de Astronomía Teórica y Experimental; Argentina
Fil: Merchan, Manuel Enrique. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Astronomía Teórica y Experimental. Universidad Nacional de Córdoba. Observatorio Astronómico de Córdoba. Instituto de Astronomía Teórica y Experimental; Argentina - Materia
-
GALAXIES: GROUPS: GENERAL
GALAXIES: HALOS
GALAXIES: LUMINOSITY FUNCTION
MASS FUNCTION - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/141240
Ver los metadatos del registro completo
id |
CONICETDig_3e5be748ca8f4122ffcaa0ee9b220c4a |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/141240 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
Combining friend-of-friend and halo-based algorithms for the identification of galaxy groupsRodriguez, FacundoMerchan, Manuel EnriqueGALAXIES: GROUPS: GENERALGALAXIES: HALOSGALAXIES: LUMINOSITY FUNCTIONMASS FUNCTIONhttps://purl.org/becyt/ford/1.3https://purl.org/becyt/ford/1Galaxy groups provide the means for a great diversity of studies that contribute to a better understanding of the structure ofthe universe on a large scale and allow the properties of galaxies to be linked to those of the host halos. However, the identification ofgalaxy systems is a challenging task and therefore it is necessary to improve the techniques involved as much as possible.Aims. 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 spectroscopicgalaxy catalogue, but here we demonstrate its use on the Sloan Digital Sky Survey.Methods. 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, particularlythe lack of ability to identify low-number groups, and consequently the inability to study the occupation of halos throughout the massrange, we improve it by adding a halo-based procedure. To assess the performance, we construct a mock catalogue from a semianalytical model to compare the groups identified using our method with those obtained from the simulation.Results. The comparison of groups extracted using our method with those of a mock catalogue shows that the proposed algorithmprovides excellent results. The modifications introduced to the friends-of-friends algorithm in the first part of the procedure to fit theadopted group definition gave reliable groups. Furthermore, incorporation of the halo-based method reduces the interlopers whilemore accurately reproducing the number of galaxies per group. As a specific application, we use the algorithm to extract groups fromthe Sloan Digital Sky SurveyFil: Rodriguez, Facundo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Astronomía Teórica y Experimental. Universidad Nacional de Córdoba. Observatorio Astronómico de Córdoba. Instituto de Astronomía Teórica y Experimental; ArgentinaFil: Merchan, Manuel Enrique. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Astronomía Teórica y Experimental. Universidad Nacional de Córdoba. Observatorio Astronómico de Córdoba. Instituto de Astronomía Teórica y Experimental; ArgentinaEDP Sciences2020-04info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/141240Rodriguez, Facundo; Merchan, Manuel Enrique; Combining friend-of-friend and halo-based algorithms for the identification of galaxy groups; EDP Sciences; Astronomy and Astrophysics; 636; 4-2020; 1-100004-63611432-0746CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.aanda.org/10.1051/0004-6361/201937423info:eu-repo/semantics/altIdentifier/doi/10.1051/0004-6361/201937423info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T09:35:42Zoai:ri.conicet.gov.ar:11336/141240instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 09:35:42.799CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
Combining friend-of-friend and halo-based algorithms for the identification of galaxy groups |
title |
Combining friend-of-friend and halo-based algorithms for the identification of galaxy groups |
spellingShingle |
Combining friend-of-friend and halo-based algorithms for the identification of galaxy groups Rodriguez, Facundo GALAXIES: GROUPS: GENERAL GALAXIES: HALOS GALAXIES: LUMINOSITY FUNCTION MASS FUNCTION |
title_short |
Combining friend-of-friend and halo-based algorithms for the identification of galaxy groups |
title_full |
Combining friend-of-friend and halo-based algorithms for the identification of galaxy groups |
title_fullStr |
Combining friend-of-friend and halo-based algorithms for the identification of galaxy groups |
title_full_unstemmed |
Combining friend-of-friend and halo-based algorithms for the identification of galaxy groups |
title_sort |
Combining friend-of-friend and halo-based algorithms for the identification of galaxy groups |
dc.creator.none.fl_str_mv |
Rodriguez, Facundo Merchan, Manuel Enrique |
author |
Rodriguez, Facundo |
author_facet |
Rodriguez, Facundo Merchan, Manuel Enrique |
author_role |
author |
author2 |
Merchan, Manuel Enrique |
author2_role |
author |
dc.subject.none.fl_str_mv |
GALAXIES: GROUPS: GENERAL GALAXIES: HALOS GALAXIES: LUMINOSITY FUNCTION MASS FUNCTION |
topic |
GALAXIES: GROUPS: GENERAL GALAXIES: HALOS GALAXIES: LUMINOSITY FUNCTION MASS FUNCTION |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/1.3 https://purl.org/becyt/ford/1 |
dc.description.none.fl_txt_mv |
Galaxy groups provide the means for a great diversity of studies that contribute to a better understanding of the structure ofthe universe on a large scale and allow the properties of galaxies to be linked to those of the host halos. However, the identification ofgalaxy systems is a challenging task and therefore it is necessary to improve the techniques involved as much as possible.Aims. 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 spectroscopicgalaxy catalogue, but here we demonstrate its use on the Sloan Digital Sky Survey.Methods. 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, particularlythe lack of ability to identify low-number groups, and consequently the inability to study the occupation of halos throughout the massrange, we improve it by adding a halo-based procedure. To assess the performance, we construct a mock catalogue from a semianalytical model to compare the groups identified using our method with those obtained from the simulation.Results. The comparison of groups extracted using our method with those of a mock catalogue shows that the proposed algorithmprovides excellent results. The modifications introduced to the friends-of-friends algorithm in the first part of the procedure to fit theadopted group definition gave reliable groups. Furthermore, incorporation of the halo-based method reduces the interlopers whilemore accurately reproducing the number of galaxies per group. As a specific application, we use the algorithm to extract groups fromthe Sloan Digital Sky Survey Fil: Rodriguez, Facundo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Astronomía Teórica y Experimental. Universidad Nacional de Córdoba. Observatorio Astronómico de Córdoba. Instituto de Astronomía Teórica y Experimental; Argentina Fil: Merchan, Manuel Enrique. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Astronomía Teórica y Experimental. Universidad Nacional de Córdoba. Observatorio Astronómico de Córdoba. Instituto de Astronomía Teórica y Experimental; Argentina |
description |
Galaxy groups provide the means for a great diversity of studies that contribute to a better understanding of the structure ofthe universe on a large scale and allow the properties of galaxies to be linked to those of the host halos. However, the identification ofgalaxy systems is a challenging task and therefore it is necessary to improve the techniques involved as much as possible.Aims. 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 spectroscopicgalaxy catalogue, but here we demonstrate its use on the Sloan Digital Sky Survey.Methods. 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, particularlythe lack of ability to identify low-number groups, and consequently the inability to study the occupation of halos throughout the massrange, we improve it by adding a halo-based procedure. To assess the performance, we construct a mock catalogue from a semianalytical model to compare the groups identified using our method with those obtained from the simulation.Results. The comparison of groups extracted using our method with those of a mock catalogue shows that the proposed algorithmprovides excellent results. The modifications introduced to the friends-of-friends algorithm in the first part of the procedure to fit theadopted group definition gave reliable groups. Furthermore, incorporation of the halo-based method reduces the interlopers whilemore accurately reproducing the number of galaxies per group. As a specific application, we use the algorithm to extract groups fromthe Sloan Digital Sky Survey |
publishDate |
2020 |
dc.date.none.fl_str_mv |
2020-04 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/141240 Rodriguez, Facundo; Merchan, Manuel Enrique; Combining friend-of-friend and halo-based algorithms for the identification of galaxy groups; EDP Sciences; Astronomy and Astrophysics; 636; 4-2020; 1-10 0004-6361 1432-0746 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/141240 |
identifier_str_mv |
Rodriguez, Facundo; Merchan, Manuel Enrique; Combining friend-of-friend and halo-based algorithms for the identification of galaxy groups; EDP Sciences; Astronomy and Astrophysics; 636; 4-2020; 1-10 0004-6361 1432-0746 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/url/https://www.aanda.org/10.1051/0004-6361/201937423 info:eu-repo/semantics/altIdentifier/doi/10.1051/0004-6361/201937423 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
EDP Sciences |
publisher.none.fl_str_mv |
EDP Sciences |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1844613114606125056 |
score |
13.070432 |