paper

VEGA: Voids idEntification using Genetic Algorithm

arXiv:2501.16431 · doi:10.1088/1475-7516/2025/12/001

Abstract

Cosmic voids are large, nearly empty regions that lie between the web of galaxies, filaments and walls, and are recognized for their extensive applications in the field of cosmology and astrophysics. Despite their significance, a universal definition of voids remains unsettled as various void-finding methods identify different types of voids, each differing in shape and density, based on the method that were used. In this paper, we present VEGA, a novel algorithm for void identification. VEGA utilizes Voronoi tessellation to divide the dataset space into spatial cells and applies the Convex Hull algorithm to estimate the volume of each cell. It then integrates Genetic Algorithm analysis with luminosity density contrast to filter out over-dense cells and retain the remaining ones, referred to as void block cells. These filtered cells form the basis for constructing the final void structures. VEGA operates on a grid of points, which increases the algorithm's spatial accessibility to the dataset and facilitates the identification of seed points around which the algorithm constructs the voids. To evaluate VEGA's performance, we applied both VEGA and the Aikio Mähönen method to the same test dataset. We compared the resulting void populations in terms of their luminosity and number density contrast, as well as their morphological features such as sphericity. This comparison demonstrated that the VEGA void finding method yields reliable results and can be effectively applied to various particle distributions.

25 pages, 3 figures, 2 table, Accepted for publication in JCAP

References in corpus (77)