The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Proximity of persistence modules and their diagrams
Open accessAbstract
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property that the persistence diagrams of nearby functions are close. However, existing stability results are restricted to the case of continuous functions defined over triangulable spaces. In this paper, we present new stability results that do not suffer from the above restrictions. Furthermore, by working at an algebraic level directly, we make it possible to compare the persistence diagrams of functions defined over different spaces, thus enabling a variety of new applications of the concept of persistence. Along the way, we extend the definition of persistence diagram to a larger setting, introduce the notions of discretization of a persistence module and associated pixelization map, define a proximity measure between persistence modules, and show how to interpolate between persistence modules, thereby lending a more analytic character to this otherwise algebraic setting. We believe these new theoretical concepts and tools shed new light on the theory of persistence, in addition to simplifying proofs and enabling new applications.
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
(2001) · Cited by 5,374
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
Zomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
Department of Computer Science
(1993) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(93)90083-n · Cited by 1,210
(1935) · Economic Record · doi:10.1111/j.1475-4932.1935.tb02774.x · Cited by 712
The theory of multidimensional persistence
Carlsson, G., & Zomorodian, A. (2007) · Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 · doi:10.1145/1247069.1247105 · Cited by 299
PERSISTENCE BARCODES FOR SHAPES
CARLSSON, G., ZOMORODIAN, A., COLLINS, A., & GUIBAS, L. J. (2005) · International Journal of Shape Modeling · doi:10.1142/s0218654305000761 · Cited by 287
Self-citationStability of persistence diagrams
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2005) · Proceedings of the twenty-first annual symposium on Computational geometry · doi:10.1145/1064092.1064133 · Cited by 251
Self-citationVines and vineyards by updating persistence in linear time
Cohen-Steiner, D., Edelsbrunner, H., & Morozov, D. (2006) · Proceedings of the twenty-second annual symposium on Computational geometry · doi:10.1145/1137856.1137877 · Cited by 239
Self-citationExtending Persistence Using Poincaré and Lefschetz Duality
Cohen‐Steiner, D., Edelsbrunner, H., & Harer, J. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-008-9038-9 · Cited by 124
Self-citation
Cited by
A roadmap for the computation of persistent homology
Otter, N., Porter, M. A., Tillmann, U., Grindrod, P., & Harrington, H. A. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0109-5 · Cited by 760
An Introduction to Topological Data Analysis: Fundamental and Practical Aspects for Data Scientists
Chazal, F., & Michel, B. (2021) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2021.667963 · Cited by 581
Self-citationStatistical topological data analysis using persistence landscapes
Bubenik, P. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.6437 · Cited by 476
The Structure and Stability of Persistence Modules
Chazal, F., de Silva, V., Glisse, M., & Oudot, S. (2016) · SpringerBriefs in Mathematics · doi:10.1007/978-3-319-42545-0 · Cited by 393
Self-citationClique topology reveals intrinsic geometric structure in neural correlations
Giusti, C., Pastalkova, E., Curto, C., & Itskov, V. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1506407112 · Cited by 381
Metadata
- Authors
- Chazal, F., Cohen-Steiner, D., Glisse, M., Guibas, L. J., & Oudot, S. Y.
- Venue
- Proceedings of the twenty-fifth annual symposium on Computational geometry
- Publisher
- ACM
- Published
- 2009-06-08
- Pages
- 237-246
- OpenAlex
- W2056761334
- Cited by
- 404
- References
- 22
- FWCI
- 11.85
- Type
- conference paper
- Language
- en
- Open access
- green
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: Proximity of persistence modules and their diagrams. https://app.cochat.ai/papers/10.1145/1542362.1542407
- The paper
- Chazal, F., Cohen-Steiner, D., Glisse, M., Guibas, L. J., & Oudot, S. Y. (2009). Proximity of persistence modules and their diagrams. Proceedings of the twenty-fifth annual symposium on Computational geometry. https://doi.org/10.1145/1542362.1542407
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.