Stability of persistence diagrams
The DOI matches its Crossref record; 29 of the 32 references it cites were found in a registry or an index.
Abstract
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the persistence diagram is stable: small changes in the function imply only small changes in the diagram. We apply this result to estimating the homology of sets in a metric space and to comparing and classifying geometric shapes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
The cited source says what the claim attributes to it.
In the citing paper
“Indeed, as shown in [7], barcodes are stable in the presence of noise added to a [Morse] filtration.”
From Barcodes: the persistent topology of data (2007) · cites this paper as [7]
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
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Morphometric Tools for Landmark Data: Geometry and Biology
Bookstein, F. L. (1992) · Cambridge University Press eBooks · doi:10.1017/cbo9780511573064 · Cited by 4,365
Spanier, E. H. (1990) · Cited by 3,014
Three-dimensional alpha shapes
Edelsbrunner, H., & Mücke, E. P. (1994) · ACM Transactions on Graphics · doi:10.1145/174462.156635 · Cited by 2,488 · cited 1×
“Indeed, the dimensions of the persistent homology groups that appear in the theorem are efficiently computable using the persistence algorithm on the filtration of alpha complexes [11, 12].”
MethodSelf-citationElements of Algebraic Topology
Munkres, J. R. (2018) · CRC Press eBooks · doi:10.1201/9780429493911 · Cited by 2,102
Introduction to Algorithms, Second Edition
Rivest, R. L., Leiserson, C. E., Cormen, T. H., & Stein, C. (2001) · Cited by 1,984
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
Introduction to linear algebra
(2016) · Cybersecurity and Applied Mathematics · doi:10.1016/b978-0-12-804452-0.09998-x · Cited by 1,646
Zomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
Introduction to algorithms: 4. Turtle graphics
Shyamasundar, R. K. (1996) · Resonance · doi:10.1007/bf02837777 · Cited by 1,467
Milnor, J. (1963) · doi:10.1515/9781400881802 · Cited by 1,390
Morphometric Tools for Landmark Data.
Bookstein, F. (1998) · Biometrics · doi:10.2307/2534038 · Cited by 1,378
ELEMENTS OF ALGEBRAIC TOPOLOGY
KURATOWSKI, K. (1972) · Introduction to Set Theory and Topology · doi:10.1016/b978-0-08-016160-0.50028-2 · Cited by 1,277 · cited 1×
“We refer to [17] for an introduction to homology that is both mathematically rigorous and accessible to non-specialists.”
BackgroundGeometric Partial Differential Equations and Image Analysis
Sapiro, G. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511626319 · Cited by 841 · cited 1×
“Due to its practical importance, it has been studied extensively in a number of areas including morphology [2] and image processing [20].”
BackgroundSurface Reconstruction by Voronoi Filtering
Amenta, N., & Bern, M. (1999) · Discrete & Computational Geometry · doi:10.1007/pl00009475 · Cited by 705
Goresky, M., & MacPherson, R. (1988) · Springer eBooks · doi:10.1007/978-3-642-71714-7 · Cited by 683
Goresky, M., & MacPherson, R. (1983) · Proceedings of Symposia in Pure Mathematics · doi:10.1090/pspum/040.1/713089 · Cited by 671 · cited 1×
“Both examples are special cases of Morse functions on Whitney-stratified spaces [14], which include a large class of piecewise smooth functions defined on smooth manifolds.”
BackgroundFinding the homology of submanifolds with high confidence from random samples
Niyogi, P., Smale, S., & Weinberger, S. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9053-2 · Cited by 523 · cited 1×
“In the smooth but possibly higher-dimensional setting, [18] shows how to build a homotopy equivalent complex, which suffices for homology estimation.”
BackgroundTopological estimation using witness complexes
Silva, V. D., & Carlsson, G. (2004) · The Eurographics Association · doi:10.2312/spbg/spbg04/157-166 · Cited by 337 · cited 1×
“We first address a problem also studied in [9], namely estimating the homology groups of a closed subset X of a metric space M from a set of possibly inaccurate point samples.”
BackgroundZomorodian, A., & Carlsson, G. (2004) · Proceedings of the twentieth annual symposium on Computational geometry · doi:10.1145/997817.997870 · Cited by 264 · cited 4×
“Recently, Carlsson et al. introduced barcodes, which are persistence diagrams (drawing points in the plane as intervals) for the curvature function of a certain derived space of the shape [3].”
BackgroundInfluentialProvable surface reconstruction from noisy samples
Dey, T. K., & Goswami, S. (2006) · Computational Geometry · doi:10.1016/j.comgeo.2005.10.006 · Cited by 218
Introduction to Linear Algebra
H., A. S., Marcus, M., & Minc, H. (1966) · Mathematics of Computation · doi:10.2307/2003521 · Cited by 165
Tubular neighborhoods in Euclidean spaces
Fu, J. H. G. (1985) · Duke Mathematical Journal · doi:10.1215/s0012-7094-85-05254-8 · Cited by 144 · cited 1×
“For instance, semi-algebraic sets always have positive weak feature size [13] and therefore positive homological feature size.”
BackgroundPersistence barcodes for shapes
Carlsson, G., Zomorodian, A., Collins, A., & Guibas, L. (2004) · Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing · doi:10.1145/1057432.1057449 · Cited by 133 · cited 4×
“Are there other interesting metrics, on functions and persistence diagrams, for which an inequality like the one in the Main Theorem holds? For example, if the distance between persistence diagrams is measured as in [3], what metrics between functions give such an inequality, if any? Other open questions are concerned…”
BackgroundMethodInfluentialProvable surface reconstruction from noisy samples
Dey, T. K., & Goswami, S. (2004) · Proceedings of the twentieth annual symposium on Computational geometry · doi:10.1145/997817.997867 · Cited by 121 · cited 2×
“How can we exploit the new insights to get improved algorithms for problems like the medial axis [5], surface reconstruction [1, 10], and alike? How far can we relax the requirements on the input data and still guarantee correct construction?”
BackgroundChazal, F., & Lieutier, A. (2005) · Proceedings of the twenty-first annual symposium on Computational geometry · doi:10.1145/1064092.1064132 · Cited by 67
Stability and homotopy of a subset of the medial axis
Chazal, F., & Lieutier, A. (2004) · ACM Symposium on Solid Modeling and Applications · doi:10.5555/1217875.1217913 · Cited by 34
Inequalities for the curvature of curves and surfaces
Cohen‐Steiner, D., & Edelsbrunner, H. (2005) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1064092.1064134 · Cited by 8 · cited 2×
“As an additional application, not described in this paper, we established that under fairly mild assumptions it is possible to estimate the total mean curvature of a smooth surface in R(3) by the discrete analog of that measure defined for a piecewise linear approximation of the smooth surface [7].”
BackgroundMethodSelf-citation(1990)
Research works printed but not linked: 5
- 5. F. Chazal and A. Lieutier. The lambda medial axis. Graphical Models 67 (2005), 304-331.
- 15. L. Lov´ asz and M. D. Plummer. Matching Theory . North-Holland, Amsterdam, 1986.
- 16. J. Milnor. Morse Theory . Princeton University Press, New Jersey, 1963.
- 19. V. Robins. Toward computing homology from finite approximations. Topology Proceedings 24 (1999), 503-532.
- 21. E. Spanier. Algebraic Topology . Springer-Verlag, New York, 1966.
Cited by
Carlsson, G. (2009) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-09-01249-x · Cited by 2,302
Barcodes: the persistent topology of data
Ghrist, R. (2007) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-07-01191-3 · Cited by 1,236
“Indeed, as shown in [7], barcodes are stable in the presence of noise added to a [Morse] filtration.”
BackgroundFinding the homology of submanifolds with high confidence from random samples
Niyogi, P., Smale, S., & Weinberger, S. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9053-2 · Cited by 523
“Finally, it is also worth noting that there is a body of work on persistence homology [7, 20] that seeks alternative topological characterizations of the manifold and its homology.”
BackgroundMethodResultProximity of persistence modules and their diagrams
Chazal, F., Cohen-Steiner, D., Glisse, M., Guibas, L. J., & Oudot, S. Y. (2009) · Proceedings of the twenty-fifth annual symposium on Computational geometry · doi:10.1145/1542362.1542407 · Cited by 404
“As mentioned above, although in some specific scenarios the problem can be easily reduced to some continuous setting, it is not clear that such reductions exist in general.”
BackgroundMethodInfluentialSelf-citationReeb graphs for shape analysis and applications
Biasotti, S., Giorgi, D., Spagnuolo, M., & Falcidieno, B. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.10.018 · Cited by 281
“Setting Mt = {p ∈ M | f (p) ≤ t} = f −1((−∞, t]), we may wish to investigate how the lower level set Mt (also known as sub-level set [15]) changes as the parameter t changes (see Fig.”
Background
Metadata
- Authors
- Cohen-Steiner, D., Edelsbrunner, H., & Harer, J.
- Affiliations
- Duke University, Durham, NC
- Duke University (US)
- Venue
- Proceedings of the twenty-first annual symposium on Computational geometry
- Publisher
- ACM
- Published
- 2005-06-06
- Pages
- 263-271
- OpenAlex
- W2020428772
- Cited by
- 251
- References
- 32
- Citations by year
- 2026: 33 · 2025: 42 · 2024: 37 · 2023: 21 · 2022: 6 · 2021: 6 · 2020: 5 · 2019: 11 · 2018: 15 · 2017: 3 · 2016: 5 · 2015: 2 · 2014: 2 · 2013: 4 · 2012: 3
- FWCI
- 8.74
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Annual Symposium on Computational Geometry (SoCG) (publishedVersion)
- 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, topological persistence
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
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.