Persistence barcodes versus Kolmogorov signatures: detecting modes of one-dimensional signals

From MaRDI portal
Publication:525596

DOI10.1007/S10208-015-9281-9zbMATH Open1367.62086arXiv1404.1214OpenAlexW3105241451MaRDI QIDQ525596FDOQ525596


Authors: Ulrich Bauer, Axel Munk, Hannes Sieling, M. Wardetzky Edit this on Wikidata


Publication date: 5 May 2017

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Abstract: We investigate the problem of estimating the number of modes (i.e., local maxima) - a well known question in statistical inference - and we show how to do so without presmoothing the data. To this end, we modify the ideas of persistence barcodes by first relating persistence values in dimension one to distances (with respect to the supremum norm) to the sets of functions with a given number of modes, and subsequently working with norms different from the supremum norm. As a particular case we investigate the Kolmogorov norm. We argue that this modification has certain statistical advantages. We offer confidence bands for the attendant Kolmogorov signatures, thereby allowing for the selection of relevant signatures with a statistically controllable error. As a result of independent interest, we show that taut strings minimize the number of critical points for a very general class of functions. We illustrate our results by several numerical examples.


Full work available at URL: https://arxiv.org/abs/1404.1214




Recommendations




Cites Work


Cited In (3)

Uses Software





This page was built for publication: Persistence barcodes versus Kolmogorov signatures: detecting modes of one-dimensional signals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q525596)