On the expectation of a persistence diagram by the persistence weighted kernel
From MaRDI portal
Publication:2009477
Abstract: In topological data analysis, persistent homology characterizes robust topological features in data and it has a summary representation, called a persistence diagram. Statistical research for persistence diagrams have been actively developed, and the persistence weighted kernel shows several advantages over other statistical methods for persistence diagrams. If data is drawn from some probability distribution, the corresponding persistence diagram have randomness. Then, the expectation of the persistence diagram by the persistence weighted kernel is well-defined. In this paper, we study relationships between a probability distribution and the persistence weighted kernel in the viewpoint of (1) the strong law of large numbers and the central limit theorem, (2) a confidence interval to estimate the expectation of the persistence weighted kernel numerically, and (3) the stability theorem to ensure the continuity of the map from a probability distribution to the expectation. In numerical experiments, we demonstrate our method gives an interesting counterexample to a common view in topological data analysis.
Recommendations
- The density of expected persistence diagrams and its kernel based estimation
- The density of expected persistence diagrams and its kernel based estimation
- Probability measures on the space of persistence diagrams
- Kernel method for persistence diagrams via kernel embedding and weight factor
- Convergence rates for persistence diagram estimation in topological data analysis
Cites work
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 5055767 (Why is no real title available?)
- A kernel two-sample test
- A topological approach for protein classification
- A topological measurement of protein compressibility
- An introduction to the theory of reproducing kernel Hilbert spaces
- Analysis of Kolmogorov flow and Rayleigh-Bénard convection using persistent homology
- Asymptotic Statistics
- Categorification of persistent homology
- Computing persistent homology
- Coverage in sensor networks via persistent homology
- Decomposition of pointwise finite-dimensional persistence modules.
- Introduction to empirical processes and semiparametric inference
- Kernel method for persistence diagrams via kernel embedding and weight factor
- Persistence images: a stable vector representation of persistent homology
- Persistence stability for geometric complexes
- Principal component analysis of persistent homology rank functions with case studies of spatial point patterns, sphere packing and colloids
- Probability in Banach spaces. Isoperimetry and processes
- Probability. Theory and examples.
- Relative interleavings and applications to sensor networks
- Stability of persistence diagrams
- Statistical topological data analysis using persistence landscapes
- Stochastic convergence of persistence landscapes and silhouettes
- Topological persistence and simplification
- Zigzag persistence
Cited in
(4)- Kernel method for persistence diagrams via kernel embedding and weight factor
- The density of expected persistence diagrams and its kernel based estimation
- The density of expected persistence diagrams and its kernel based estimation
- On the choice of weight functions for linear representations of persistence diagrams
This page was built for publication: On the expectation of a persistence diagram by the persistence weighted kernel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009477)
