The density of expected persistence diagrams and its kernel based estimation - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

The density of expected persistence diagrams and its kernel based estimation

Abstract

Persistence diagrams play a fundamental role in Topological Data Analysis where they are used as topological descriptors of filtrations built on top of data. They consist in discrete multisets of points in the plane R 2 that can equivalently be seen as discrete measures in R 2. When the data come as a random point cloud, these discrete measures become random measures whose expectation is studied in this paper. First, we show that for a wide class of filtrations, including the Čech and Rips-Vietoris filtrations, the expected persistence diagram, that is a deterministic measure on R 2 , has a density with respect to the Lebesgue measure. Second, building on the previous result we show that the persistence surface recently introduced in [Adams & al., Persistence images: a stable vector representation of persistent homology] can be seen as a kernel estimator of this density. We propose a cross-validation scheme for selecting an optimal bandwidth, which is proven to be a consistent procedure to estimate the density.
Fichier principal
Vignette du fichier
paper.pdf (683.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01716181 , version 1 (23-02-2018)
hal-01716181 , version 2 (22-03-2019)
hal-01716181 , version 3 (25-04-2019)

Identifiers

  • HAL Id : hal-01716181 , version 3

Cite

Frédéric Chazal, Vincent Divol. The density of expected persistence diagrams and its kernel based estimation. SoCG 2018 - Symposium of Computational Geometry, Jun 2018, Budapest, Hungary. ⟨hal-01716181v3⟩
435 View
633 Download

Share

Gmail Facebook X LinkedIn More