Student or educator? Sign up with your school email and get 6 months of Pro free.

The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index; 1 of the 21 sources its claims cite were checked for support.

Stability of Persistence Diagrams

Open access
Cohen-Steiner, David, Edelsbrunner, Herbert, Harer, John · 2007 · Discrete & Computational Geometry

Overview

CoChat Summary

TL;DR

The paper proves that persistence diagrams of real-valued functions on topological spaces are stable: small changes in the function imply small changes in the diagram under the bottleneck distance. It applies this stability to homology estimation from point samples and to comparing/classifying geometric shapes.

Key findings

  • The Main Theorem states that for a triangulable space \(X\) with continuous tame functions \(f,g:X\to\mathbb R\), the persistence diagrams satisfy \(d_B(D(f),D(g)) \le \|f-g\|_\infty\).
  • The proof first establishes stability for the Hausdorff distance using the Box Lemma, then strengthens it to the bottleneck distance using the Easy Bijection Lemma and an Interpolation Lemma for piecewise linear functions.
  • The Homology Inference Theorem states that for all real \(\varepsilon\) with \(d_H(X,P) < \varepsilon < \mathrm{hfs}_X/4\) and all sufficiently small \(\delta>0\), the dimensions of the homology group of \(X+\delta\) and \(P^\varepsilon_{3\varepsilon}\) are either both infinite or both finite and equal.
  • The Barcode Theorem states that if a diffeomorphism \(\Phi:\mathbb R^d\to\mathbb R^d\) has derivatives up to second order close to those of a rigid motion, then the bottleneck distance between the barcodes of a hypersurface \(S\subseteq\mathbb R^d\) and its perturbation \(\Phi(S)\) is small.

Methods

  • Theoretical study of real-valued functions on topological spaces, using homology with \(\mathbb Z_2\) coefficients, homological critical values, tame functions, persistent homology groups, and persistence diagrams.
  • Stability is proved by algebraic-topological diagram chasing: the Quadrant Lemma and Box Lemma bound multiplicities in nested quadrants/boxes, and the bottleneck case is handled by composing bijections for very close functions and interpolating between piecewise linear functions.
  • Applications are derived as corollaries; the paper reports no empirical data, experiments, or numerical evaluations.

Limitations

  • The paper explicitly leaves open whether the Main Theorem extends to non-tame functions, whether other metrics on functions and persistence diagrams admit similar inequalities, and how to exploit the result algorithmically.
  • Evident from the text: the main theorem assumes a triangulable space and continuous tame functions, and the proof uses compactness, finite simplicial complexes, and finite-dimensional homology groups.
  • Evident from the text: the applications are theoretical corollaries, and the Barcode Theorem states only that the bottleneck distance is “small” under \(C^2\)-closeness to a rigid motion, without a quantitative bound.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1007/s00454-006-1276-5

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Fig. 1 The multiplicity of the point ( ai , aj ) is the alternating sum of persistent Betti numbers at the corners of the lower right square. When adding other multiplicities, cancellations between plus and minus signs occur.
Fig. 1 The multiplicity of the point ( ai , aj ) is the alternating sum of persistent Betti numbers at the corners of the lower right square. When adding other multiplicities, cancellations between plus and minus signs occur.From the PDF
Fig. 2 (a) Two close functions, one with many and the other with just four critical values. (b) The persistence diagrams of the two functions, and the bijection between them.
Fig. 2 (a) Two close functions, one with many and the other with just four critical values. (b) The persistence diagrams of the two functions, and the bijection between them.From the PDF
Fig. 3 (a) Homology group of the sub-level set f -1 ( -∞ , x ]. (b) Image of Fx in Fy . (c) Kernel of surjection F y x → F z x . (d) Quotient of F y , z x and F y , z w .
Fig. 3 (a) Homology group of the sub-level set f -1 ( -∞ , x ]. (b) Image of Fx in Fy . (c) Kernel of surjection F y x → F z x . (d) Quotient of F y , z x and F y , z w .From the PDF
Image 4
From the PDF
Image 5
From the PDF
Image 6
From the PDF
Image 7
From the PDF
Fig. 5 The shaded squares are centered at the (black) points of D ( f ) . The white squares are centered at the (white) points of D ( g ) .
Fig. 5 The shaded squares are centered at the (black) points of D ( f ) . The white squares are centered at the (white) points of D ( g ) .From the PDF
Fig. 6 The bold curve has a positive homological feature size, equal to the radius of the dotted circle, but it has zero reach because the three cusp points have a vanishing local feature size.
Fig. 6 The bold curve has a positive homological feature size, equal to the radius of the dotted circle, but it has zero reach because the three cusp points have a vanishing local feature size.From the PDF

Verification

Claims the paper makes

1 Valid · 7 Not valid · 19 Not checked · 31 Own results and interpretations

21 more claims

Create a free account to see all 58 claims and every source verdict.

See all claims — free account
  • Probably not a substantial claim. 28
  • It may state two separate claims as one. 13

Create a free account to see these claims.

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?

Citations

Cites

Show all 30 references

Research works printed but not linked: 2

  1. [16]16. J. Milnor. Morse Theory . Princeton University Press, New Jersey, 1963.
  2. [19]19. V. Robins. Toward computing homology from finite approximations. Topology Proceedings 24 (1999), 503-532.

Cited by

See all 1,300

Metadata

Authors
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J.
Affiliations
Duke University (US)
Corresponding author
  • Edelsbrunner, Herbert
  • Harer, John
Venue
Discrete & Computational Geometry
Published
2006-12-12
Volume
37
Issue
1
Pages
103-120
ISSN
  • 0179-5376 (ISSN-L)
  • 1432-0444
OpenAlex
W2037613900
Cited by
1,280
References
30
Citations by year
2026: 102 · 2025: 89 · 2024: 69 · 2023: 97 · 2022: 78 · 2021: 132 · 2020: 109 · 2019: 89 · 2018: 92 · 2017: 50 · 2016: 60 · 2015: 54 · 2014: 58 · 2013: 48 · 2012: 29
FWCI
18.03
Type
journal article
Language
en
Open access
Licence
www.springer.com/tdm (tdm)
Locations
Discrete & Computational Geometry (publishedVersion)
Funders
  • National Science Foundation (0086013)
  • Defense Advanced Research Projects Agency (HR0011, HR0011-05-1-0007)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
  • Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
  • Physical Sciences › Mathematics › Applied Mathematics › Geometric Analysis and Curvature Flows
Keywords
persistence diagrams, stability, topological data analysis, metric spaces, shape comparison, real functions, simplicial complexes

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.

The claim verdicts this report counts are experimental: their accuracy is not yet measured.

A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).

A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).

Cited sources are checked with a language model’s help (gpt-6-sol).

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: Stability of Persistence Diagrams. https://app.cochat.ai/papers/10.1007/s00454-006-1276-5
The paper
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2007). Stability of Persistence Diagrams. Discrete & Computational Geometry. https://doi.org/10.1007/s00454-006-1276-5

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.