A random persistence diagram generator
From MaRDI portal
Abstract: Topological data analysis (TDA) studies the shape patterns of data. Persistent homology is a widely used method in TDA that summarizes homological features of data at multiple scales and stores them in persistence diagrams (PDs). In this paper, we propose a random persistence diagram generator (RPDG) method that generates a sequence of random PDs from the ones produced by the data. RPDG is underpinned by a model based on pairwise interacting point processes, and a reversible jump Markov chain Monte Carlo (RJ-MCMC) algorithm. A first example, which is based on a synthetic dataset, demonstrates the efficacy of RPDG and provides a comparison with another method for sampling PDs. A second example demonstrates the utility of RPDG to solve a materials science problem given a real dataset of small sample size.
Recommendations
- Modelling persistence diagrams with planar point processes, and revealing topology with bagplots
- Stochastic convergence of persistence landscapes and silhouettes
- Persistence curves: a canonical framework for summarizing persistence diagrams
- Stochastic convergence of persistence landscapes and silhouettes
- The density of expected persistence diagrams and its kernel based estimation
Cites work
- scientific article; zbMATH DE number 6020480 (Why is no real title available?)
- scientific article; zbMATH DE number 720750 (Why is no real title available?)
- scientific article; zbMATH DE number 1455125 (Why is no real title available?)
- A Bayesian framework for persistent homology
- A model for clustering
- A stable cardinality distance for topological classification
- Approximating Point Process Likelihoods with GLIM
- Challenges in topological object data analysis
- Computational topology. An introduction
- Confidence sets for persistence diagrams
- Fréchet means for distributions of persistence diagrams
- Hypothesis testing for topological data analysis
- Modeling and replicating statistical topology and evidence for CMB nonhomogeneity
- Modelling persistence diagrams with planar point processes, and revealing topology with bagplots
- Nonparametric estimation of probability density functions of random persistence diagrams
- Persistence stability for geometric complexes
- Practical Maximum Pseudolikelihood for Spatial Point Patterns
- Probabilistic Fréchet means for time varying persistence diagrams
- Probability measures on the space of persistence diagrams
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- Robust statistics, hypothesis testing, and confidence intervals for persistent homology on metric measure spaces
- Robust topological inference: distance to a measure and kernel distance
- Signal classification with a point process distance on the space of persistence diagrams
- Stochastic convergence of persistence landscapes and silhouettes
- The Accumulated Persistence Function, a New Useful Functional Summary Statistic for Topological Data Analysis, With a View to Brain Artery Trees and Spatial Point Process Applications
- Topological consistency via kernel estimation
Cited in
(3)
This page was built for publication: A random persistence diagram generator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084325)
