Filamentary galaxy clustering: A mapping algorithm

Journal Article · Sat Oct 01 04:00:00 EDT 1983 · Astrophys. J.; (United States)

OSTI ID:5172118

Moody, J E; Turner, E L; Gott, III, J R

The Shane-Wirtanen galaxy count catalog gives the strong visual impression of large-scale linear or filamentary features in the galaxy distribution. Computer simulations of hierarchical galaxy clustering constructed to have two-, three-, and four-point autocorrelation functions like those observed do not have such an appearance. A simple and well-defined algorithm which maps and quantifies filamentary structure is developed. It appears to be successful in identifying those (and only those) filaments which the eye picks out in the Shane-Wirtanen catalog and thus provides an objective tool for studying these structures. A catalog and map of the most prominent Shane-Wirtanen filaments is given. Application of the algorithm to a computer simulation of hierarchical galaxy clustering reveals a set of visually less conspicuous filaments with statistical properties strikingly similar to those of the Shane-Wirtanen filaments in many respects. Long (> or approx. =10/sup 0/) filaments do occur significantly more frequently in the data than in the simulations and the real filaments do occur at slightly higher relative contrast than the simulation filaments. These facts may explain their greater visual impact. It is not yet clear whether the Shane-Wirtanen filaments can be understood in terms of simple hierarchical galaxy clustering models.

• Research Organization: Department of Physics, Princeton University
• OSTI ID: 5172118
• Journal Information: Astrophys. J.; (United States), Journal Name: Astrophys. J.; (United States) Vol. 273:1; ISSN ASJOA
• Country of Publication: United States
• Language: English

Related Subjects

640105* -- Astrophysics & Cosmology-- Galaxies
71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
ALGORITHMS
CATALOGS
COMPUTERIZED SIMULATION
COSMOLOGY
DOCUMENT TYPES
GALAXY CLUSTERS
MAPS
MATHEMATICAL LOGIC
SIMULATION