The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Confidence sets for persistence diagrams
Open accessAbstract
Persistent homology is a method for probing topological properties of point clouds and functions. The method involves tracking the birth and death of topological features (2000) as one varies a tuning parameter. Features with short lifetimes are informally considered to be “topological noise,” and those with a long lifetime are considered to be “topological signal.” In this paper, we bring some statistical ideas to persistent homology. In particular, we derive confidence sets that allow us to separate topological signal from topological noise.
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
Carlsson, G. (2009) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-09-01249-x · Cited by 2,302 · cited 3×
“Topological data analysis (TDA) refers to a collection of methods for finding topological structure in data (Carlsson (2009); Edelsbrunner and Harer (2010)).”
BackgroundMethodStability 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
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 reach of A—denoted by reach(A)— is the largest ε ≥ 0 such that each point in A ⊕ ε has a unique projection onto A (Federer (1959)).”
BackgroundFinding the homology of submanifolds with high confidence from random samples
Niyogi, P., Smale, S., & Weinberger, S. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9053-2 · Cited by 523
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
Lipschitz Functions Have L p -Stable Persistence
Cohen-Steiner, D., Edelsbrunner, H., Harer, J., & Mileyko, Y. (2010) · Foundations of Computational Mathematics · doi:10.1007/s10208-010-9060-6 · Cited by 284
The Theory of Multidimensional Persistence
Carlsson, G., & Zomorodian, A. (2009) · Discrete & Computational Geometry · doi:10.1007/s00454-009-9176-0 · Cited by 270
Probability measures on the space of persistence diagrams
Mileyko, Y., Mukherjee, S., & Harer, J. (2011) · Inverse Problems · doi:10.1088/0266-5611/27/12/124007 · Cited by 249
Fréchet Means for Distributions of Persistence Diagrams
Turner, K., Mileyko, Y., Mukherjee, S., & Harer, J. (2014) · Discrete & Computational Geometry · doi:10.1007/s00454-014-9604-7 · Cited by 207
Cited by
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
A tutorial on kernel density estimation and recent advances
Chen, Y.-C. (2017) · Biostatistics & Epidemiology · doi:10.1080/24709360.2017.1396742 · Cited by 830
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
Wasserman, L. (2018) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-031017-100045 · Cited by 514
Self-citation
Metadata
- Authors
- Fasy, B. T., Lecci, F., Rinaldo, A., Wasserman, L., Balakrishnan, S., & Singh, A.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2014-12-01
- Volume
- 42
- Issue
- 6
- Pages
- 2301-2339
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W2065833332
- Cited by
- 243
- References
- 9
- FWCI
- 14.74
- Type
- journal article
- 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: Confidence sets for persistence diagrams. https://app.cochat.ai/papers/10.1214/14-aos1252
- The paper
- Fasy, B. T., Lecci, F., Rinaldo, A., Wasserman, L., Balakrishnan, S., & Singh, A. (2014). Confidence sets for persistence diagrams. The Annals of Statistics. https://doi.org/10.1214/14-aos1252
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.