The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Morse Theory for Filtrations and Efficient Computation of Persistent Homology
Open accessOverview
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
Spanier, E. H. (1990) · Cited by 3,014
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Carlsson, G. (2009) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-09-01249-x · Cited by 2,302 · cited 1×
“The use of topological methods for data analysis is rapidly growing and persistent homology is proving to be one of the more successful techniques [1, 7, 8, 11].”
MethodElements of Algebraic Topology
Munkres, J. R. (2018) · CRC Press eBooks · doi:10.1201/9780429493911 · Cited by 2,102
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
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
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
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 · cited 1×
“The use of topological methods for data analysis is rapidly growing and persistent homology is proving to be one of the more successful techniques [1, 7, 8, 11].”
MethodMorse Theory for Cell Complexes
Forman, R. (1998) · Advances in Mathematics · doi:10.1006/aima.1997.1650 · Cited by 943
Edelsbrunner, H., & Harer, J. (2008) · Contemporary Mathematics · doi:10.1090/conm/453/08802 · Cited by 848
Edelsbrunner, H., & Harer, J. (2009) · American Mathematical Society eBooks · doi:10.1090/mbk/069 · Cited by 820
Combinatorial Algebraic Topology
Kozlov, D. (2008) · Algorithms and Computation in Mathematics · doi:10.1007/978-3-540-71962-5 · Cited by 525
Gaussian Elimination is not Optimal
Trassen, V. (2005) · Cited by 454
Lefschetz, S. (1942) · Cited by 331
Theory and Algorithms for Constructing Discrete Morse Complexes from Grayscale Digital Images
Robins, V., Wood, P. J. W., & Sheppard, A. P. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.95 · Cited by 269
Lefschetz, S. (1942) · Colloquium Publications - American Mathematical Society/Colloquium Publications · doi:10.1090/coll/027 · Cited by 220
An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
Delfinado, C. J. A., & Edelsbrunner, H. (1995) · Computer Aided Geometric Design · doi:10.1016/0167-8396(95)00016-y · Cited by 183
Zigzag persistent homology in matrix multiplication time
Milosavljević, N., Morozov, D., & Skraba, P. (2011) · International Symposium on Computational Geometry · doi:10.1145/1998196.1998229 · Cited by 177
Near optimal algorithms for computing Smith normal forms of integer matrices
Storjohann, A. (1996) · International Symposium on Symbolic and Algebraic Computation · doi:10.1145/236869.237084 · Cited by 127
Discrete Morse Theoretic Algorithms for Computing Homology of Complexes and Maps
Harker, S., Mischaikow, K., Mrożek, M., & Nanda, V. (2013) · Foundations of Computational Mathematics · doi:10.1007/s10208-013-9145-0 · Cited by 113
Self-citationEfficient Computation of Persistent Homology for Cubical Data
Wagner, H., Chen, C., & Vuçını, E. (2011) · Mathematics and visualization · doi:10.1007/978-3-642-23175-9_7 · Cited by 112
Coreduction Homology Algorithm
Mrożek, M., & Batko, B. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9073-y · Cited by 112
Asymptotically Fast Triangularization of Matrices over Rings
Hafner, J. L., & McCurley, K. S. (1991) · SIAM Journal on Computing · doi:10.1137/0220067 · Cited by 107
Topology for Computing (Cambridge Monographs on Applied and Computational Mathematics)
Zomorodian, A. J., Ablowitz, M. J., Davis, S. H., Hinch, E. J., Iserles, A., Ockendon, J. R., & Olver, P. J. (2005) · Cambridge University Press eBooks · Cited by 84
Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms
Dumas, J.-G., Heckenbach, F., Saunders, D., & Welker, V. (2003) · Algebra, Geometry and Software Systems · doi:10.1007/978-3-662-05148-1_10 · Cited by 61
Coreduction homology algorithm for inclusions and persistent homology
Mrożek, M., & Wanner, T. (2010) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2010.09.036 · Cited by 39
The Efficiency of a Homology Algorithm based on Discrete Morse Theory and Coreductions
Harker, S., Mischaikow, K., Mrożek, M., Nanda, V., Wagner, H., Juda, M., & Dłotko, P. (2010) · Cited by 32
Self-citationMemory-Efficient Computation of Persistent Homology for 3D Images Using Discrete Morse Theory
Günther, D., Reininghaus, J., Hotz, I., et al. (2011) · SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI) · doi:10.1109/sibgrapi.2011.24 · Cited by 24
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
Giusti, C., Ghrist, R., & Bassett, D. S. (2016) · Journal of Computational Neuroscience · doi:10.1007/s10827-016-0608-6 · Cited by 424
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
Cang, Z., & Wei, G.-W. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005690 · Cited by 330
Sliding Windows and Persistence: An Application of Topological Methods to Signal Analysis
Perea, J. A., & Harer, J. (2015) · Foundations of Computational Mathematics · doi:10.1007/s10208-014-9206-z · Cited by 306
“While there has been considerable progress on dealing with the size problem of the Rips complex [20], it is important to have a sense of the amount of retained information given the computational constraints on the embedding dimension.”
BackgroundMethodInfluential
Metadata
- Authors
- Mischaikow, K., & Nanda, V.
- Venue
- Discrete & Computational Geometry
- Published
- 2013-07-27
- Volume
- 50
- Issue
- 2
- Pages
- 330-353
- ISSN
- 0179-5376 (ISSN-L)
- 1432-0444
- OpenAlex
- W2002165972
- Cited by
- 252
- References
- 29
- FWCI
- 20.54
- Type
- journal article
- Language
- en
- Open access
- bronze
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.