The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
zobov: a parameter-free void-finding algorithm
Open accessAbstract
zobov (ZOnes Bordering On Voidness) is an algorithm that finds density depressions in a set of points, without any free parameters, or assumptions about shape. It uses the Voronoi tessellation to estimate densities, which it uses to find both voids and subvoids. It also measures probabilities that each void or subvoid arises from Poisson fluctuations. This paper describes the zobov algorithm, and the results from its application to the dark matter particles in a region of the Millennium simulation. Additionally, the paper points out an interesting high-density peak in the probability distribution of dark matter particle densities.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Simulations of the formation, evolution and clustering of galaxies and quasars
Springel, V., White, S. D. M., Jenkins, A., Frenk, C. S., Yoshida, N., Gao, L., Navarro, J., Thacker, R., Croton, D., Helly, J., et al. (2005) · Nature · doi:10.1038/nature03597 · Cited by 5,067
Croton, D. J., Springel, V., White, S. D. M., De Lucia, G., Frenk, C. S., Gao, L., Jenkins, A., Kauffmann, G., Navarro, J. F., & Yoshida, N. (2006) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2005.09675.x · Cited by 3,685
(2000) · Wiley Series in Probability and Statistics · doi:10.1002/9780470317013 · Cited by 1,811
Croton, D., Springel, V., White, S. D. M., Lucia, G. D., Frenk, C. S., Gao, L., Jenkins, A. R., Kauffmann, G., Navarro, J. F., & Yoshida, N. (2006) · Max Planck Digital Library · doi:10.25916/sut.26253068.v1 · Cited by 1,611
How filaments of galaxies are woven into the cosmic web
Bond, J. R., Kofman, L., & Pogosyan, D. (1996) · Nature · doi:10.1038/380603a0 · Cited by 1,167
Properties of dark matter haloes in clusters, filaments, sheets and voids
Hahn, O., Porciani, C., Carollo, C. M., & Dekel, A. (2007) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2006.11318.x · Cited by 508
A hierarchy of voids: much ado about nothing
Sheth, R. K., & van de Weygaert, R. (2004) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2004.07661.x · Cited by 503
Peebles, P. J. E. (2001) · The Astrophysical Journal · doi:10.1086/322254 · Cited by 317
A cosmic watershed: the WVF void detection technique
Platen, E., Van De Weygaert, R., & Jones, B. J. T. (2007) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2007.12125.x · Cited by 277
Aragón-Calvo, M. A., Jones, B. J. T., van de Weygaert, R., & van der Hulst, J. M. (2007) · Astronomy & Astrophysics · doi:10.1051/0004-6361:20077880 · Cited by 251
Cited by
Sousbie, T. (2011) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2011.18394.x · Cited by 674
Libeskind, N. I., van de Weygaert, R., Cautun, M., Falck, B., Tempel, E., Abel, T., Alpaslan, M., Aragón-Calvo, M. A., Forero-Romero, J. E., Gonzalez, R., et al. (2018) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stx1976 · Cited by 360
Self-citationDi Valentino, E., Said, J. L., Riess, A., Pollo, A., Poulin, V., Gómez-Valent, A., Weltman, A., Palmese, A., Huang, C. D., Bruck, C. V. D., et al. (2025) · Physics of the Dark Universe · doi:10.1016/j.dark.2025.101965 · Cited by 319
Unveiling the Universe with emerging cosmological probes
Moresco, M., Amati, L., Amendola, L., Birrer, S., Blakeslee, J. P., Cantiello, M., Cimatti, A., Darling, J., Della Valle, M., Fishbach, M., et al. (2022) · Living Reviews in Relativity · doi:10.1007/s41114-022-00040-z · Cited by 311
Sousbie, T., Pichon, C., & Kawahara, H. (2011) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2011.18395.x · Cited by 302
Metadata
- Authors
- Neyrinck, M. C.
- Venue
- Monthly Notices of the Royal Astronomical Society
- Publisher
- Oxford University Press (OUP)
- Published
- 2008-06
- Volume
- 386
- Issue
- 4
- Pages
- 2101-2109
- ISSN
- 0035-8711 (ISSN-L)
- 1365-2966
- OpenAlex
- W2070820850
- Cited by
- 365
- References
- 25
- FWCI
- 3.34
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: zobov: a parameter-free void-finding algorithm. https://app.cochat.ai/papers/10.1111/j.1365-2966.2008.13180.x
- The paper
- Neyrinck, M. C. (2008). zobov: a parameter-free void-finding algorithm. Monthly Notices of the Royal Astronomical Society. https://doi.org/10.1111/j.1365-2966.2008.13180.x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.