The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Zigzag persistent homology and real-valued functions
Abstract
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a topological space. The result is a local, symmetric interval descriptor of the function. Our structural results establish a connection between the zigzag pairs in this sequence and extended persistence, and in the process resolve an open question associated with the latter. Our algorithmic results not only provide a way to compute zigzag persistence for any sequence of homology groups, but combined with our structural results give a novel algorithm for computing extended persistence. This algorithm is easily parallelizable and uses (asymptotically) less memory.
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
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
(2001) · Cited by 5,374
Carlsson, G. (2009) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-09-01249-x · Cited by 2,302 · cited 1×
“We claim that diagrams of other shapes should also be useful in understanding point cloud data [2, 3].”
BackgroundSelf-citationTopological 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
Self-citationStability of Persistence Diagrams
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-006-1276-5 · Cited by 1,280
Gabriel, P. (1972) · manuscripta mathematica · doi:10.1007/bf01298413 · Cited by 771
Proximity of persistence modules and their diagrams
Chazal, F., Cohen‐Steiner, D., Glisse, M., Guibas, L. J., & Oudot, S. (2009) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1542362.1542407 · Cited by 411
Carlsson, G., & de Silva, V. (2010) · Foundations of Computational Mathematics · doi:10.1007/s10208-010-9066-0 · Cited by 263
Self-citation
Research works printed but not linked: 2
- Abdi Herve, 2007, Sage
- Carlsson Gunnar, 2008, Stanford University, 0812
Cited by
Sorted by citations
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 769
What are higher-order networks?
Bick, C., Gross, E., Harrington, H. A., & Schaub, M. T. (2023) · SIAM Review · doi:10.1137/21m1414024 · Cited by 420
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 481
Cang, Z., & Wei, G.-W. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005690 · Cited by 330
Carlsson, G., & de Silva, V. (2010) · Foundations of Computational Mathematics · doi:10.1007/s10208-010-9066-0 · Cited by 263
Self-citation
Metadata
- Authors
- Carlsson, G., de Silva, V., & Morozov, D.
- Affiliations
- Stanford University (US)
- Pomona College (US)
- Venue
- Proceedings of the twenty-fifth annual symposium on Computational geometry
- Publisher
- ACM
- Published
- 2009-06-08
- Pages
- 247-256
- OpenAlex
- W2158407067
- Cited by
- 272
- References
- 17
- Citations by year
- 2026: 3 · 2025: 9 · 2024: 8 · 2023: 10 · 2022: 7 · 2021: 19 · 2020: 18 · 2019: 14 · 2018: 15 · 2017: 16 · 2016: 10 · 2015: 93 · 2014: 14 · 2013: 13 · 2012: 9
- FWCI
- 6.33
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Annual Symposium on Computational Geometry (SoCG) (publishedVersion)
- Funders
- Pomona College
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
- Physical Sciences › Mathematics › Mathematical Physics › Homotopy and Cohomology in Algebraic Topology
- Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
- Keywords
- zigzag persistence, persistent homology, level sets, real functions, homology groups, computational topology, parallel algorithms, memory-efficient algorithms
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
