Probability measures on the space of persistence diagrams

  title={Probability measures on the space of persistence diagrams},
  author={Yuriy Mileyko and Sayan Mukherjee and John Harer},
  journal={Inverse Problems},
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… 

Figures from this paper

Persistence Weighted Gaussian Kernel for Probability Distributions on the Space of Persistence Diagrams
A persistence diagram characterizes robust geometric and topological features in data. Data, which will be treated here, are assumed to be drawn from a probability distribution and then the
Means and medians of sets of persistence diagrams
The space of persistence diagrams is looked at under a variety of different metrics which are analogous to L p metrics on the space of functions, which gives the natural definitions of both the mean and median of a finite number of persistence diagram.
Medians of populations of persistence diagrams
Persistence diagrams are common objects in the field of Topological Data Analysis. They are topological summaries that capture both topological and geometric structure within data. Recently there has
Statistical topological data analysis using persistence landscapes
A new topological summary for data that is easy to combine with tools from statistics and machine learning and obeys a strong law of large numbers and a central limit theorem is defined.
Probabilistic Fréchet means for time varying persistence diagrams
This work alters the original definition of Fr\'echet mean so that it now becomes a probability measure on the set of persistence diagrams and shows that this map is Holder continuous on finite diagrams and thus can be used to build a useful statistic on time-varying persistence diagrams, better known as vineyards.
Statistical Analysis of Persistence Intensity Functions
This work provides a modification and formalization of the persistence intensity function, which can be used to visualize multiple diagrams, perform clustering and conduct two-sample tests.
Statistical topology using persistence landscapes
A new descriptor for persistent homology is defined, which is thought of as an embedding of the usual descriptors, barcodes and persistence diagrams, into a space of functions, which inherits an L norm, and it is shown that this metric space is complete and separable.
Optimal rates of convergence for persistence diagrams in Topological Data Analysis
It is shown that the use of persistent homology can be naturally considered in general statistical frameworks and persistence diagrams can be used as statistics with interesting convergence properties.
Convergence Rates for Persistence Diagram Estimation in
Computational topology has recently seen an important development toward data analysis, giving birth to the eld of topological data analysis. Topological persistence, or persistent homology, appears
The space of persistence diagrams on $n$ points coarsely embeds into Hilbert space
We prove that the space of persistence diagrams on $n$ points (with the bottleneck or a Wasserstein distance) coarsely embeds into Hilbert space by showing it is of asymptotic dimension $2n$. Such an


Statistical topology via Morse theory, persistence and nonparametric estimation
In this paper we examine the use of topological methods for multivariate statistics. Using persistent homology from computational algebraic topology, a random sample is used to construct estimators
A statistical approach to persistent homology
Using statistical estimators for samples from certain families of distributions, it is shown that the persistent homology of the underlying distribution can be recovered.
Boundary Measures for Geometric Inference
The main contribution of this work is the proof of a quantitative stability theorem for boundary measures using tools of convex analysis and geometric measure theory for Federer’s curvature measures.
Probability, Convexity, and Harmonic Maps with Small Image I: Uniqueness and Fine Existence
This paper uses probability theory to provide an approach to the Dirichlet problem for harmonic maps. The probabilistic tools used are those of manifold-valued Brownian motion and Γ-martingales.
Random Geometric Complexes
  • Matthew Kahle
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 2011
The expected topological properties of Čech and Vietoris–Rips complexes built on random points in ℝd are studied and asymptotic formulas for the expectation of the Betti numbers in the sparser regimes, and bounds in the denser regimes are given.
Geometric Representations of Hypergraphs for Prior Specification and Posterior Sampling
This parametrization of hypergraphs based on the geometry of points in R can recover both the junction tree factorization as well as the hyper Markov law and is used to infer conditional independence models or Markov structure of multivariate distributions.
A Topological View of Unsupervised Learning from Noisy Data
It is shown that if the variance of the Gaussian noise is small in a certain sense, then the homology can be learned with high confidence by an algorithm that has a weak (linear) dependence on the ambient dimension.
Remarks on Some Nonparametric Estimates of a Density Function
1. Summary. This note discusses some aspects of the estimation of the density function of a univariate probability distribution. All estimates of the density function satisfying relatively mild
Central limit theorems for some graphs in computational geometry
Let Bn be an increasing sequence of regions in d-dimensional space with volume n and with union d. We prove a general central limit theorem for functionals of point sets, obtained either by
A Sampling Theory for Compact Sets in Euclidean Space
A parameterized notion of feature size is introduced that interpolates between the minimum of the local feature size and the recently introduced weak feature size to ensure the topological correctness of a reconstruction given by an offset of the sampling.