The density of expected persistence diagrams and its kernel based estimation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Computational Geometry Année : 2019

The density of expected persistence diagrams and its kernel based estimation

Frédéric Chazal
Vincent Divol

Résumé

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 $\mathbb{R}^2$ that can equivalently be seen as discrete measures in $\mathbb{R}^2$. When the data is assumed to be random, 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 Vietoris-Rips filtrations, but also the sublevels of a Brownian motion, the expected persistence diagram, that is a deterministic measure on $\mathbb{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 et al. [2017] 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 non déposé

Dates et versions

hal-04308723 , version 1 (27-11-2023)

Identifiants

Citer

Frédéric Chazal, Vincent Divol. The density of expected persistence diagrams and its kernel based estimation. Journal of Computational Geometry, 2019, 10 (2), ⟨10.20382/jocg.v10i2a7⟩. ⟨hal-04308723⟩
8 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More