Confidence sets for persistence diagrams

Abstract

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.

Published in at http://dx.doi.org/10.1214/14-AOS1252 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (6)

• Confidence sets for persistence diagrams
• On the uniform asymptotic validity of subsampling and the bootstrap
• Optimal rates of convergence for persistence diagrams in Topological Data Analysis
• The structure and stability of persistence modules
• Towards Stratification Learning through Homology Inference
• Robust statistics, hypothesis testing, and confidence intervals for persistent homology on metric measure spaces

Cited by in corpus (64)

• Networks beyond pairwise interactions: structure and dynamics
• A roadmap for the computation of persistent homology
• Statistical topological data analysis using persistence landscapes
• What are higher-order networks?
• Is the Observable Universe Consistent with the Cosmological Principle?
• Confidence sets for persistence diagrams
• A persistence landscapes toolbox for topological statistics
• Persistence weighted Gaussian kernel for topological data analysis
• Robust Topological Inference: Distance To a Measure and Kernel Distance
• Using persistent homology and dynamical distances to analyze protein binding
• Topological consistency via kernel estimation
• Finding cosmic voids and filament loops using topological data analysis
• A Population Background for Nonparametric Density-Based Clustering
• Analyzing Collective Motion with Machine Learning and Topology
• Modeling and replicating statistical topology, and evidence for CMB non-homogeneity
• Induced Matchings and the Algebraic Stability of Persistence Barcodes
• Probabilistic Convergence and Stability of Random Mapper Graphs
• Approximating Continuous Functions on Persistence Diagrams Using Template Functions
• Geometric Inference on Kernel Density Estimates
• Persistence Diagrams as Diagrams: A Categorification of the Stability Theorem
• Optimal rates of convergence for persistence diagrams in Topological Data Analysis
• Topological Data Analysis (TDA) for Time Series
• Tropical Sufficient Statistics for Persistent Homology
• Topological Data Analysis for Object Data
• A Study on Topological Descriptors for the Analysis of 3D Surface Texture
• Stabilizing the unstable output of persistent homology computations
• Random Simplicial Complexes: Models and Phenomena
• Uniform Convergence Rate of the Kernel Density Estimator Adaptive to Intrinsic Volume Dimension
• A persistent homology approach to heart rate variability analysis with an application to sleep-wake classification
• Generalized Penalty for Circular Coordinate Representation
• Bootstrapping Persistent Betti Numbers and Other Stabilizing Statistics
• Differentiating small-scale subhalo distributions in CDM and WDM models using persistent homology
• Supervised topological data analysis for MALDI mass spectrometry imaging applications
• Nonparametric Inference For Density Modes
• ANAPT: Additive Noise Analysis for Persistence Thresholding
• Unsupervised Space-Time Clustering using Persistent Homology
• Recovering the homology of immersed manifolds
• Randomness of Shapes and Statistical Inference on Shapes via the Smooth Euler Characteristic Transform
• A probabilistic result on impulsive noise reduction in Topological Data Analysis through Group Equivariant Non-Expansive Operators
• Nonparametric Estimation of Probability Density Functions of Random Persistence Diagrams
• Topological reconstruction of compact supports of dependent stationary random variables
• Persistence Barcodes versus Kolmogorov Signatures: Detecting Modes of One-Dimensional Signals
• Data-Driven Analysis of Pareto Set Topology
• Asymptotics of Lower Dimensional Zero-Density Regions
• Geometric Learning and Topological Inference with Biobotic Networks: Convergence Analysis
• Asymptotics and Optimal Bandwidth for Nonparametric Estimation of Density Level Sets
• Isometric Gaussian Process Latent Variable Model for Dissimilarity Data
• Nonparametric Inference via Bootstrapping the Debiased Estimator
• Topological Detection of Trojaned Neural Networks
• $A_{\infty }$ persistent homology estimates the topology from pointcloud datasets
• Curvature of point clouds through principal component analysis
• Topological data analysis approaches to uncovering the timing of ring structure onset in filamentous networks
• Robust Persistence Diagrams using Reproducing Kernels
• The growing topology of the C. elegans connectome
• Unsupervised topological learning for identification of atomic structures
• Detection of Small Holes by the Scale-Invariant Robust Density-Aware Distance (RDAD) Filtration
• Stability for Inference with Persistent Homology Rank Functions
• Robust Topological Feature Extraction for Mapping of Environments using Bio-Inspired Sensor Networks
• Improving Metric Dimensionality Reduction with Distributed Topology
• Confidence regions for a persistence diagram of a single image with one or more loops
• A Geometric Condition for Uniqueness of Fréchet Means of Persistence Diagrams
• Nonparametric Confidence Regions for Level Sets: Statistical Properties and Geometry
• ${\ell }^p$-Distances on Multiparameter Persistence Modules
• Persistent topology for cryo-EM data analysis