The theory of multidimensional persistence
The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Abstract
Persistent homology captures the topology of a filtration - a one-parameter family of increasing spaces - in terms of a complete discrete invariant. This invariant is a multiset of intervals that denote the lifetimes of the topological entities within the filtration. In many applications of topology, we need to study a multifiltration: a family of spaces parameterized along multiple geometric dimensions. In this paper, we show that no similar complete discrete invariant exists for multidimensional persistence. Instead, we propose the rank invariant, a discrete invariant for the robust estimation of Betti numbers in a multifiltration, and prove its completeness in one dimension.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“However, there are fundamental algebraic difficulties in constructing an analogous theory of persistence modules in this setting [24].”
From Barcodes: the persistent topology of data (2007) · cites this paper as [24]
In the citing paper
“Proposition 4.2.The category of N n -persistence vector spaces over a field F is equivalent to the category of n-multigraded modules over the polynomial ring A(n) = F [x 1 , x 2 , . . ., x n ], where the multigrading structure on A(n) is given by”
From Topology and data (2009) · cites this paper as [12]
In the citing paper
“Proposition 4.4.In the case n = 1, the rank invariant is a complete invariant of the isomorphism class of a finitely generated graded F [t]-module for F a field.”
From Topology and data (2009) · cites this paper as [12]
Citations
Cites
Commutative algebra with a view toward algebraic geometry
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4552 · Cited by 3,738
An Introduction to Homological Algebra
Weibel, C. A. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9781139644136 · Cited by 3,706 · cited 10×
“We may develop standard homological algebra in the category of graded modules over an n-graded k-algebra An, with the resulting derived functors . and HomAn now being equipped with the structure An of an n-graded An-module [16].”
InfluentialIntroduction To Commutative Algebra
Atiyah, M. (2018) · CRC Press eBooks · doi:10.1201/9780429493638 · Cited by 2,883
Mumford, D., Fogarty, J., & Kirwan, F. (1994) · Springer Grundlehren · doi:10.1007/978-3-642-57916-5 · Cited by 2,564
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
Self-citationBarcodes: 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 · cited 1×
“Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complex ity]: Nonnumerical Algorithms and Problems Computations on discrete structures General Terms Algorithms, Theory Keywords computational topology, multidimensional analysis, persistent homology 1.”
InfluentialOn the Local Behavior of Spaces of Natural Images
Carlsson, G., Ishkhanov, T., de Silva, V., & Zomorodian, A. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-007-0056-x · Cited by 477
Self-citationRepresentations of Finite-Dimensional Algebras
Gabriel, P., & Roiter, A. V. (1997) · Encyclopaedia of Mathematical Sciences · doi:10.1007/978-3-642-58097-0 · Cited by 390 · cited 1×
“Our approach is entirely in the spirit of the representation theory of finite dimensional algebras [11].”
Topological estimation using witness complexes
Silva, V. D., & Carlsson, G. (2004) · The Eurographics Association · doi:10.2312/spbg/spbg04/157-166 · Cited by 337 · cited 3×
“In higher dimensions, one may uncover even more interesting structure, as was demonstrated for the nine-dimensional Mumford dataset [5].”
Self-citationPERSISTENCE 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-citationThe Nonlinear Statistics of High-Contrast Patches in Natural Images
Lee, A. B., Pedersen, K. S., & Mumford, D. (2003) · International Journal of Computer Vision · doi:10.1023/a:1023705401078 · Cited by 234
(2005) · Graduate Texts in Mathematics · doi:10.1007/b137572 · Cited by 200
(1987) · Mathematical Sciences Research Institute Publications · doi:10.1007/978-1-4613-9586-7 · Cited by 174
A barcode shape descriptor for curve point cloud data
Collins, A., Zomorodian, A., Carlsson, G., & Guibas, L. J. (2004) · Computers & Graphics · doi:10.1016/j.cag.2004.08.015 · Cited by 132 · cited 2×
“Of course, we could apply persistent homology along any single dimension by fixing the value of the other parameters, as indicated by the boxes the figure [4].”
Self-citationTopology-based Simplification for Feature Extraction from 3D Scalar Fields
Gyulassy, A. G., Natarajan, V., Pascucci, V., Bremer, P., & Bernd Hamann, A. (2006) · doi:10.1109/vis.2005.106 · Cited by 96 · cited 1×
“This is the key reason for the current popularity of persistent homology for solving problems in diverse disciplines, such as shape description [4], denoising volumetric density data [13], detecting holes in sensor networks [6], and analyzing the structure of natural images [5].”
Size homotopy groups for computation of natural size distances
Frosini, P., & Mulazzani, M. (1999) · Bulletin of the Belgian Mathematical Society - Simon Stevin · doi:10.36045/bbms/1103065863 · Cited by 84 · cited 1×
“Variants of this problem have appeared in other contexts, such as the first size homotopy groups [10].”
Blind Swarms for Coverage in 2-D
de Silva, V., Ghrist, R., & Muhammad, A. (2005) · Robotics: Science and Systems I · doi:10.15607/rss.2005.i.044 · Cited by 78 · cited 1×
“This is the key reason for the current popularity of persistent homology for solving problems in diverse disciplines, such as shape description [4], denoising volumetric density data [13], detecting holes in sensor networks [6], and analyzing the structure of natural images [5].”
Chazal, F., & Lieutier, A. (2005) · Proceedings of the twenty-first annual symposium on Computational geometry · doi:10.1145/1064092.1064132 · Cited by 67
A refinement of multi-dimensional persistence
KNUDSON, K. P. (2008) · Homology Homotopy and Applications · doi:10.4310/hha.2008.v10.n1.a11 · Cited by 38
Terao, H. (2002) · Topology and its Applications · doi:10.1016/s0166-8641(01)00054-2 · Cited by 16 · cited 3×
“[15] Terao, H. Moduli space of combinatorially equivalent arrangements of hyperplanes and logarithmic Gauss-Manin connections.”
Gauss–Man i n Conne ction s for Arrangements, I E igenvalues
Cohen, D. C., & Orlik, P. (2003) · Compositio Mathematica · doi:10.1023/a:1023262022279 · Cited by 7
Gauss-Manin connections for arrangements, IV. Nonresonant eigenvalues
Cohen, D. C., & Orlik, P. (2006) · Commentarii Mathematici Helvetici · doi:10.4171/cmh/79 · Cited by 4
Cited by
Carlsson, G. (2009) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-09-01249-x · Cited by 2,302
Self-citationBarcodes: 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
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J., & Petri, G. (2020) · UCL Discovery (University College London) · Cited by 1,179
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
“See [24, 100] for the theory of multi-parameter persistent homology, and see [86] (and [85] for its companion paper) for upcoming software for the visualization of 2-parameter persistent homology.”
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
Metadata
- Authors
- Carlsson, G., & Zomorodian, A.
- Affiliations
- Stanford University (US)
- Dartmouth College (US)
- ORCID
- Carlsson, Gunnar
- Venue
- Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07
- Publisher
- ACM Press
- Published
- 2007
- Pages
- 184
- OpenAlex
- W2110369778
- Cited by
- 299
- References
- 23
- Citations by year
- 2026: 5 · 2025: 7 · 2024: 10 · 2023: 21 · 2022: 13 · 2021: 25 · 2020: 29 · 2019: 26 · 2018: 18 · 2017: 17 · 2016: 16 · 2015: 15 · 2014: 16 · 2013: 18 · 2012: 12
- Type
- conference abstract
- 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 › Mathematical Physics › Homotopy and Cohomology in Algebraic Topology
- Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
- Keywords
- persistent homology, Betti numbers, discrete invariants, topological data analysis
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.