English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 10630578      Online Users : 62
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 理學院 > 天文研究所 > 期刊論文 >  A new galaxy group finding algorithm: Probability friends-of-friends

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/53954

    Title: A new galaxy group finding algorithm: Probability friends-of-friends
    Authors: Liu, Hauyu Baobab;Hsieh, B. C.;Ho, Paul T. P.;Lin, Lihwai;Yan, Renbin
    教師: 賀曾樸
    Date: 2008
    Publisher: American Astronomical Society
    Relation: ASTROPHYSICAL JOURNAL,Volume: 681,Issue: 2,Pages: 1046-1057,Published: JUL 10 2008
    Abstract: A new algorithm is developed, based on the friends-of-friends (FOF) algorithm, to identify galaxy groups in a galaxy catalog in which the redshift errors have large dispersions (e. g., a photometric redshift galaxy catalog in which a portion of the galaxies also have much more precise spectroscopic redshifts). The DEEP2 mock catalogs, with our additional simulated photometric redshift errors, are used to test the performance of our algorithm. The association of the reconstructed galaxy groups with the dark halos in the mock catalogs gives an idea about the completeness and purity of the derived group catalog. Our results show that in a 0: 6 <= z <= 1: 6 galaxy catalog with an R-band limiting magnitude of 24.1 and an average 1 sigma photometric redshift error of similar to 0.03, the overall purity of our new algorithm for richness 4-7 (line-of-sight velocity dispersion similar to 300 km s(-1)) groups is higher than 70% (i.e., 70% of the groups reconstructed by our algorithm are related to real galaxy groups). The performance of the new algorithm is compared with the performance of the FOF algorithm, and it is suggested that this new algorithm is better than FOF for a database, given the same redshift uncertainties.
    URI: http://aas.org/
    Appears in Collections:[天文研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback