Related papers: Testing the Accuracy of Redshift Space Group Findi…
Two algorithms for the identification of galaxy groups from redshift surveys are tested by application to simulated data derived from N-body simulation. The accuracy of the membership assignments by these algorithms is studied in a…
We have performed a detailed analysis of the ability of the friends-of-friends algorithm in identifying real galaxy systems in deep surveys such as the future Javalambre Physics of the Accelerating Universe Astrophysical Survey. Our…
We construct a galaxy groups catalogue from the public 100K data release of the 2dF galaxy redshift survey. The group identification is carried out using a slightly modified version of the group finding algorithm developed by Huchra &…
Galaxy groups are essential for studying the distribution of matter on a large scale in redshift surveys and for deciphering the link between galaxy traits and their associated halos. In this work, we propose a widely applicable method for…
We investigate the performance of group finding algorithms that reconstruct galaxy groups from the positional information of tracer galaxies that are observed in redshift surveys carried out with multiplexed spectrographs. We use mock…
We present an automated method to detect populations of groups in galaxy redshift catalogs. This method uses both analysis of the redshift distribution along lines of sight in fixed cells to detect elementary structures and a…
We present a structure finding algorithm designed to identify galaxy groups in photometric redshift data sets: the probability friends-of-friends (pFoF) algorithm. This algorithm is derived by combining the friends-of-friends algorithm in…
Identifying galaxy groups from redshift surveys of galaxies plays an important role in connecting galaxies with the underlying dark matter distribution. Current and future high-$z$ spectroscopic surveys, usually incomplete in redshift…
We identify galaxy groups and clusters in volume-limited samples of the SDSS redshift survey, using a redshift-space friends-of-friends algorithm. We optimize the friends-of-friends linking lengths to recover galaxy systems that occupy the…
We present a modified version of the friends-of-friends (FOF) structure finding algorithm, designed specifically to locate groups or clusters of galaxies in photometric redshift datasets. The main objective of this paper is to show that…
The Universe at the present epoch is found to be a network of matter over-dense and under-dense regions. To date, this picture of the Universe is best revealed through cosmological large-volume simulations and large-scale galaxy redshift…
We have compared numerical simulations to observations for the nearby (< 40 Mpc) groups of galaxies (Huchra & Geller 1982 and Ramella et al. 2002). The group identification is carried out using a group-finding algorithm developed by Huchra…
The construction of a catalogue of galaxy groups from the 2-degree Field Galaxy Redshift Survey (2dFGRS) is described. Groups are identified by means of a friends-of-friends percolation algorithm which has been thoroughly tested on mock…
We create a new catalogue of groups and clusters for the 2dF GRS final release sample. We show that the variable linking length friends-of-friends (FoF) algorithms used so far yield groups with sizes that grow systematically with distance…
We present a new cluster detection algorithm designed for finding high-redshift clusters using optical/infrared imaging data. The algorithm has two main characteristics. First, it utilises each galaxy's full redshift probability function,…
We investigate the clustering properties of loose groups in the Perseus--Pisces redshift Survey (PPS). Previous analyses based on CfA and SSRS surveys led to apparently contradictory results. We investigate the source of such discrepancies,…
We present a large catalog of loose groups of galaxies in the Southern Galactic Hemisphere, selected from the Perseus-Pisces redshift Survey (PPS). Particular care is taken in order to obtain group samples as homogeneous as possible to…
In this work we present an algorithm to identify compact groups (CGs) that closely follows Hickson's original aim and that improves the completeness of the samples of compact groups obtained from redshift surveys. Instead of identifying CGs…
Numerous methods for finding clusters at moderate to high redshifts have been proposed in recent years, at wavelengths ranging from radio to X-rays. In this paper we describe a new method for detecting clusters in two-band optical/near-IR…
Context. Groups form the most abundant class of galaxy systems. They act as the principal drivers of galaxy evolution and can be used as tracers of the large-scale structure and the underlying cosmology. However, the detection of galaxy…