Statistical topological data analysis using persistence landscapes
Abstract
We define a new topological summary for data that we call the persistence landscape. Since this summary lies in a vector space, it is easy to combine with tools from statistics and machine learning, in contrast to the standard topological summaries. Viewed as a random variable with values in a Banach space, this summary obeys a strong law of large numbers and a central limit theorem. We show how a number of standard statistical tests can be used for statistical inference using this summary. We also prove that this summary is stable and that it can be used to provide lower bounds for the bottleneck and Wasserstein distances.
Cite
@article{arxiv.1207.6437,
title = {Statistical topological data analysis using persistence landscapes},
author = {Peter Bubenik},
journal= {arXiv preprint arXiv:1207.6437},
year = {2015}
}
Comments
26 pages, final version, to appear in Journal of Machine Learning Research, includes two additional examples not in the journal version: random geometric complexes and Erdos-Renyi random clique complexes