The Structure and Stability of Persistence Modules
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
This book is a comprehensive treatment of the theory of persistence modules over the real line. It presents a set of mathematical tools to analyse the structure and to establish the stability of such modules, providing a sound mathematical framework for the study of persistence diagrams. Completely self-contained, this brief introduces the notion of persistence measure and makes extensive use of a new calculus of quiver representations to facilitate explicit computations. Appealing to both beginners and experts in the subject, The Structure and Stability of Persistence Modules provides a purely algebraic presentation of persistence, and thus complements the existing literature, which focuses mainly on topological and algorithmic aspects.
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.
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
Zomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
Stability 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 · cited 2×
“These techniques depend on a thorough understanding of finitely-indexed persistence modules known as ‘An-quiver representations’ [19, 15].”
BackgroundProximity 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
Self-citationZigzag persistent homology and real-valued functions
Carlsson, G., de Silva, V., & Morozov, D. (2009) · Proceedings of the twenty-fifth annual symposium on Computational geometry · doi:10.1145/1542362.1542408 · Cited by 272
Carlsson, G., & de Silva, V. (2010) · Foundations of Computational Mathematics · doi:10.1007/s10208-010-9066-0 · Cited by 263
Persistence stability for geometric complexes
Chazal, F., de Silva, V., & Oudot, S. (2014) · Geometriae Dedicata · doi:10.1007/s10711-013-9937-z · Cited by 250
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
Decomposition of pointwise finite-dimensional persistence modules
Crawley-Boevey, W. (2015) · Journal of Algebra and Its Applications · doi:10.1142/s0219498815500668 · Cited by 209
The Theory of the Interleaving Distance on Multidimensional Persistence Modules
Lesnick, M. (2015) · Foundations of Computational Mathematics · doi:10.1007/s10208-015-9255-y · Cited by 203
Extending 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
Categorification of Persistent HomologyPreprint
Bubenik, P., Jonathan, & Scott, A. (2016) · Cited by 123
Persistence-based clustering in riemannian manifolds
Chazal, F., Guibas, L. J., Oudot, S., & Škraba, P. (2011) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/1998196.1998212 · Cited by 51
Self-citation
Cited by
Statistical topological data analysis using persistence landscapes
Bubenik, P. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.6437 · Cited by 476
Clique 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
Ripser: efficient computation of Vietoris–Rips persistence barcodes
Bauer, U. (2021) · Journal of Applied and Computational Topology · doi:10.1007/s41468-021-00071-5 · Cited by 280
Metadata
- Authors
- Chazal, F., de Silva, V., Glisse, M., & Oudot, S.
- Venue
- SpringerBriefs in Mathematics
- Publisher
- Springer International Publishing
- Published
- 2016
- ISSN
- 2191-8198 (ISSN-L)
- 2191-8201
- OpenAlex
- W1596721197
- Cited by
- 393
- References
- 13
- FWCI
- 22.65
- Type
- book
- 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
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.