The DOI matches its Crossref record; 34 of the 35 references it cites were found in a registry or an index.
Probability measures on the space of persistence diagrams
Open accessAbstract
This paper shows that the space of persistence diagrams has properties that allow for the definition of probability measures which support expectations, variances, percentiles and conditional probabilities. This provides a theoretical basis for a statistical treatment of persistence diagrams, for example computing sample averages and sample variances of persistence diagrams. We first prove that the space of persistence diagrams with the Wasserstein metric is complete and separable. We then prove a simple criterion for compactness in this space. These facts allow us to show the existence of the standard statistical objects needed to extend the theory of topological persistence to a much larger set of applications.
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.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Theorem 4.11 (Mileyko et al. 2011). The metric space ( ˆ B p , ˆ d p ) is complete and separable.”
From Topological pattern recognition for point cloud data (2014) · cites this paper as Mileyko et al. 2011
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“One obstacle to realizing this goal is the fact that the metric space ( B ∞ , d p ) is not complete.”
From Topological pattern recognition for point cloud data (2014) · cites this paper as Mileyko et al. (2011)
The cited source says what the claim attributes to it.
In the citing paper
“The resulting metric space is simpler to work with computationally, and all the existence results from Mileyko et al. (2011) are also shown to hold in Turner et al. (2014).”
From Topological pattern recognition for point cloud data (2014) · cites this paper as Mileyko et al. (2011)
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
On Estimation of a Probability Density Function and Mode
Parzen, E. (1962) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704472 · Cited by 10,831
Jeffreys, H., Moran, P. A. P., & Chatfield, C. (1922) · Nature · doi:10.1038/109132a0 · Cited by 7,877
The Earth Mover's Distance as a Metric for Image Retrieval
Rubner, Y., Tomasi, C., & Guibas, L. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026543900054 · Cited by 5,547
Topics in Optimal Transportation
Villani, C. (2003) · Graduate studies in mathematics · doi:10.1090/gsm/058 · Cited by 5,426
Remarks on Some Nonparametric Estimates of a Density Function
Rosenblatt, M. (1956) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728190 · Cited by 4,703
Penrose, M. (2003) · doi:10.1093/acprof:oso/9780198506263.001.0001 · Cited by 2,480
(1972) · Elsevier eBooks · doi:10.1016/c2013-0-06164-6 · Cited by 1,728
Computational topology an introduction
Edelsbrunner, H., & Harer, J. (2010) · Cited by 1,718
Self-citationDudley, R. M. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511755347 · Cited by 1,291
Riemannian center of mass and mollifier smoothing
Karcher, H. (1977) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160300502 · Cited by 995
On the Translocation of Masses
Kantorovich, L. V. (2006) · Journal of Mathematical Sciences · doi:10.1007/s10958-006-0049-2 · Cited by 776
Probability Metrics and the Stability of Stochastic Models
Freeman, J., & Rachev, S. T. (1992) · Journal of the Operational Research Society · doi:10.2307/2583297 · Cited by 723
Real Analysis and Probability.
Ahmad, R., & Dudley, R. M. (1991) · Journal of the Royal Statistical Society Series D (The Statistician) · doi:10.2307/2348742 · Cited by 685
Berger, J. O., & Wolpert, R. L. (1988) · doi:10.1214/lnms/1215466210 · Cited by 616
Les éléments aléatoires de nature quelconque dans un espace distancié
Fréchet, M. (1948) · French digital mathematics library (Numdam) · Cited by 573
Finding 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
Topological estimation using witness complexes
Silva, V. D., & Carlsson, G. (2004) · The Eurographics Association · doi:10.2312/spbg/spbg04/157-166 · Cited by 337
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
Self-citationProbability, Convexity, and Harmonic Maps with Small Image I: Uniqueness and Fine Existence
Kendall, W. S. (1990) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s3-61.2.371 · Cited by 281
Geometric Inference for Probability Measures
Chazal, F., Cohen‐Steiner, D., & Mérigot, Q. (2011) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9098-0 · Cited by 213
Central Limit Theorems for Some Graphs in Computational Geometry
Penrose, M. D., & Yukich, J. E. (2001) · The Annals of Applied Probability · doi:10.1214/aoap/1015345393 · Cited by 192
Topology of random clique complexes
Kahle, M. (2008) · Discrete Mathematics · doi:10.1016/j.disc.2008.02.037 · Cited by 190
Probability Metrics and the Stability of Stochastic Models
Freeman, J. (1992) · Journal of the Operational Research Society · doi:10.1057/jors.1992.135 · Cited by 188
A unified approach to the change of resolution: space and gray-level
Peleg, B., Werman, M., & Rom, H. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.192468 · Cited by 170
A Topological View of Unsupervised Learning from Noisy Data
Niyogi, P., Smale, S. T., & Weinberger, S. (2011) · SIAM Journal on Computing · doi:10.1137/090762932 · Cited by 150
Kahle, M. (2011) · Discrete & Computational Geometry · doi:10.1007/s00454-010-9319-3 · Cited by 150
A Sampling Theory for Compact Sets in Euclidean Space
Chazal, F., Cohen‐Steiner, D., & Lieutier, A. (2009) · Discrete & Computational Geometry · doi:10.1007/s00454-009-9144-8 · Cited by 132
Limit theorems for Betti numbers of random simplicial complexes
Kahle, M., & Meckes, E. (2013) · Homology Homotopy and Applications · doi:10.4310/hha.2013.v15.n1.a17 · Cited by 132
A statistical approach to persistent homology
Bubenik, P., & Kim, P. T. (2007) · Homology Homotopy and Applications · doi:10.4310/hha.2007.v9.n2.a12 · Cited by 116
Separability and completeness for the Wasserstein distance
Bolley, F. (2008) · Lecture notes in mathematics · doi:10.1007/978-3-540-77913-1_17 · Cited by 95
Exploring uses of persistent homology for statistical analysis of landmark-based shape data
Gamble, J., & Heo, G. (2010) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2010.04.016 · Cited by 68
Statistical topology via Morse theory persistence and nonparametric estimation
Bubenik, P., Carlsson, G., Kim, P. T., & Luo, Z. (2010) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/516/10167 · Cited by 44
Boundary Measures for Geometric Inference
Chazal, F., Cohen‐Steiner, D., & Mérigot, Q. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9056-2 · Cited by 36
Towards Stratification Learning through Homology InferencePreprint
Bendich, P. L., Mukherjee, S., & Wang, B. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1008.3572 · Cited by 9
Self-citation
Research works printed but not linked: 7
- de Silva V, 2004, Symp. on Point-based Graphics, 157
- Edelsbrunner H, 2008, Discrete and Computational Geometry. Twenty Years Later, 257
- Wasserstein L N, 1969, Probl. Inf. Transm., 5, 47
- Kantorovich L V, 1942, C. R. (Doklady) Acad. Sci. URSS, 37, 199
- Fréchet M, 1944, Rev. Sci., 82, 483
- Fréchet M, 1948, Ann. Inst. Henri Poincare, 10, 215
- Jeffreys H, 1961, Theory of Probability
Cited by
Sorted by citations
Statistical Aspects of Wasserstein Distances
Panaretos, V. M., & Zemel, Y. (2018) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-030718-104938 · Cited by 879
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
Statistical topological data analysis using persistence landscapesPreprint
Bubenik, P. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.6437 · Cited by 628
Persistence Images: A Stable Vector Representation of Persistent HomologyPreprint
Adams, H., Chepushtanova, S., Emerson, T., Hanson, E., Kirby, M. J. L., Motta, F. C., Neville, R., Peterson, C., Shipman, P. D., & Ziegelmeier, L. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.06217 · Cited by 517
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
Self-citation
Metadata
- Authors
- Mileyko, Y., Mukherjee, S., & Harer, J.
- Affiliations
- Duke University (US)
- Venue
- Inverse Problems
- Publisher
- IOP Publishing
- Published
- 2011-11-10
- Volume
- 27
- Issue
- 12
- Pages
- 124007
- ISSN
- 0266-5611 (ISSN-L)
- 1361-6420
- OpenAlex
- W2037817770
- Cited by
- 249
- References
- 35
- Citations by year
- 2026: 15 · 2025: 19 · 2024: 24 · 2023: 20 · 2022: 19 · 2021: 39 · 2020: 26 · 2019: 13 · 2018: 11 · 2017: 9 · 2016: 13 · 2015: 14 · 2014: 13 · 2013: 7 · 2012: 6
- FWCI
- 8.15
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Inverse Problems (publishedVersion)
- Funders
- National Science Foundation (1049290)
- Princeton University
- Brazilian Biodivesity Fund
- National Institutes of Health
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Topological and Geometric Data Analysis
- Physical Sciences › Mathematics › Applied Mathematics › Geometric Analysis and Curvature Flows
- Physical Sciences › Mathematics › Geometry and Topology › Geometric and Algebraic Topology
- Keywords
- persistence diagrams, probability measures, Wasserstein distance, topological data analysis, compactness, sample variance, conditional probability
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
