Cited by 674Topological and Geometric Data AnalysisGalaxies: Formation, Evolution, PhenomenaCosmology and Gravitation Theories

The persistent cosmic web and its filamentary structure - I. Theory and implementation: Persistent cosmic web - I: Theory and implementation

Open access
Sousbie, T.·2011·Monthly Notices of the Royal Astronomical Society

Abstract

We present DisPerSE, a novel approach to the coherent multiscale identification of all types of astrophysical structures, in particular the filaments, in the large-scale distribution of the matter in the Universe. This method and the corresponding piece of software allows for a genuinely scale-free and parameter-free identification of the voids, walls, filaments, clusters and their configuration within the cosmic web, directly from the discrete distribution of particles in N-body simulations or galaxies in sparse observational catalogues. To achieve that goal, the method works directly over the Delaunay tessellation of the discrete sample and uses the Delaunay tessellation field estimator density computed at each tracer particle; no further sampling, smoothing or processing of the density field is required. The idea is based on recent advances in distinct subdomains of the computational topology, namely the discrete Morse theory which allows for a rigorous application of topological principles to astrophysical data sets, and the theory of persistence, which allows us to consistently account for the intrinsic uncertainty and Poisson noise within data sets. Practically, the user can define a given persistence level in terms of robustness with respect to noise (defined as a ‘number of σ’) and the algorithm returns the structures with the corresponding significance as sets of critical points, lines, surfaces and volumes corresponding to the clusters, filaments, walls and voids – filaments, connected at cluster nodes, crawling along the edges of walls bounding the voids. From a geometrical point of view, the method is also interesting as it allows for a robust quantification of the topological properties of a discrete distribution in terms of Betti numbers or Euler characteristics, without having to resort to smoothing or having to define a particular scale. In this paper, we introduce the necessary mathematical background and describe the method and implementation, while we address the application to 3D simulated and observed data sets in the companion paper (Sousbie, Pichon & Kawahara, Paper II).

Integrity signals

Registry

Crossref · 10.1111/j.1365-2966.2011.18394.x

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Persistent homology gives a method which allows us to track topological behaviour of excursion sets as the thresholds for these excursion sets decrease.

    “It was recognized in Sousbie (2011) and Sousbie, Pichon and Kawahara (2011) that persistent homology gives a method which allows us to track topological behaviour of excursion sets as the thresholds for these excursion sets decrease.”

    From Topological pattern recognition for point cloud data (2014) · cites this paper as Sousbie (2011)

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Sousbie, T.
Affiliations
Institut d'Astrophysique de Paris (FR)
Corresponding author
Sousbie, T.
Venue
Monthly Notices of the Royal Astronomical Society
Published
2011-04-11
Volume
414
Issue
1
Pages
350-383
ISSN
0035-8711 (ISSN-L)
OpenAlex
W2150372924
Cited by
674
References
1
Citations by year
2026: 48 · 2025: 67 · 2024: 70 · 2023: 52 · 2022: 48 · 2021: 60 · 2020: 70 · 2019: 62 · 2018: 35 · 2017: 33 · 2016: 41 · 2015: 32 · 2014: 25 · 2013: 6 · 2012: 19
FWCI
16.93
Type
journal article
Language
en
Open access
Locations
  • Monthly Notices of the Royal Astronomical Society (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • HAL (submittedVersion, other-oa)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
  • Physical Sciences › Physics and Astronomy › Astronomy and Astrophysics › Galaxies: Formation, Evolution, Phenomena
  • Physical Sciences › Physics and Astronomy › Astronomy and Astrophysics › Cosmology and Gravitation Theories
Keywords
cosmic web, large-scale structure, filaments, voids, walls, galaxy clusters, DisPerSE, Delaunay tessellation, discrete Morse theory, topological persistence, computational topology, Betti numbers, Euler characteristic, N-body simulations, galaxy catalog

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